A few examples help build intuition for what the eigenvalues of the graph Laplacian tell us about a graph. The smallest eigenvalue is always zero (see explanation in footnote here).

For a complete graph on *n* vertices, all the eigenvalues except the first equal *n*. The eigenvalues of the Laplacian of a graph with *n* vertices are always less than or equal to *n*, this says the complete graph has the largest possible eigenvalue. This makes sense in light of the previous post: adding edges increases the eigenvalues. When you add as many edges as possible, you get the largest possible eigenvalues.

Conversely, if all the non-zero eigenvalues of the graph Laplacian are equal, the graph is complete.

Next we look at the case of a star with *n* − 1 vertices connected to a central vertex. The smallest eigenvalue is zero, as always, and the largest is *n*. The ones in the middle are all 1. In particular, the second eigenvalue, the algebraic connectivity, is 1. It’s positive because the graph is connected, but it’s not large because the graph is not well connected: if you remove the central vertex it becomes completely disconnected.

Finally, we look at a cyclical graph, a ring with *n* vertices. Here the eigenvalues are 2 − 2 cos(2π*k*/*n*) where 0 ≤ *k* ≤ *n/*2. In particular, smallest non-zero eigenvalue is 2 − 2 cos(2π/*n*) and so as *n* increases, the algebraic connectivity approaches zero. This is curious since the topology doesn’t change at all. But from a graph theory perspective, a big ring is less connected than a small ring. In a big ring, each vertex is connected to a small proportion of the vertices, and the average distance between vertices is larger.

Really enjoying your recent posts on graph theory!

How can we write Matrix of Star graph in terms of standard matrices whose eigen values are known, then applying spectral mapping theorem and obtaining eigenvalues of Star graph. Like Laplacian matrix of complete graph equals nI-J, where n is no of vertices, I is identity matrix and J is matrix whose all entries are 1.