For fixed integers , and odd , a *Moore graph* is an -regular graph of girth which has the minimum number of vertices among all such graphs with the same regularity and girth. 600 more words

## Tags » Eigenvalues

#### A Spectral Analysis of Moore Graphs

#### The End 2016 Mathematics A To Z: Algebra

So let me start the End 2016 Mathematics A To Z with a word everybody figures they know. As will happen, everybody’s right and everybody’s wrong about that. 912 more words

#### Perth, week 4

And now the time in Adelaide and Perth is over. We are back in London, having arrived on the same day as we left Australia. This was the first time I have done this, and I really don’t recommend it. 540 more words

#### Principal Component Analysis Tutorial

Recently I have been reading up on **Principal Component Analysis (PCA)**. PCA is essentially a compression technique, providing a means of representing larger or high dimensional data sets with less information. 1,592 more words

#### Solution to the Clebsch puzzle

Here is the solution to the puzzle about the Clebsch graph I posed at the weekend. Since Gordon and Tony (and probably others) have already solved it, I am giving you my solution now. 459 more words

#### Principal Component Analysis Explained Visually

http://setosa.io/ev/principal-component-analysis/

“Principal component analysis (PCA) is a technique used to emphasize variation and bring out strong patterns in a dataset. It’s often used to make data easy to explore and visualize.” 28 more words

#### Linear Algebra II: Eigenvectors and Diagonalisability

This post continues the discussion of the Oxford first-year course Linear Algebra II. We’ve moved on from determinants, and are now considering eigenvalues and eigenvectors of matrices and linear maps. 1,436 more words