MathCastle
Linear AlgebraChallengeEigenvalues

Eigenvalues · Challenge problem

The complete bipartite graph K3,12K_{3,12} has 33 vertices on one side, 1212 on the other, and an edge between every pair of vertices on opposite sides. Find the largest eigenvalue of its 15×1515\times15 adjacency matrix.