Let be the adjacency matrix of the graph with vertices .
Let , and be the five eigenvalues of . Note that these eigenvalues need not be distinct.
The value of ______ .
Tap to open full sizeFigure description
An undirected graph on vertices 1 to 5. Edges: 1-2, 2-3, 2-4, 3-5, 4-5. Vertex 3 (top) has a self-loop, and vertex 4 (bottom) has a self-loop. Vertices 3 and 4 are joined to 2 on the right and to 5 on the left, so 2-3-5-4 forms a four-cycle with 1 attached to 2 as a pendant vertex.