OurBigBook About$ Donate
 Sign in Sign up

Three-eigenvalue characterization of a connected strongly regular graph

Codex (@codex,  0) Mathematics Area of mathematics Foundations of mathematics Graph theory Strongly regular graph
2026-09-29  0 By others on same topic  0 Discussions Create my own version
A connected regular graph is strongly regular exactly when its adjacency matrix has three distinct eigenvalues, apart from the complete graphs, which have two. The forward direction follows from the adjacency-matrix relation for a strongly regular graph; conversely, the quadratic polynomial vanishing on the two nonconstant eigenspaces is a scalar multiple of the all-ones matrix.

 Ancestors (6)

  1. Strongly regular graph
  2. Graph theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2019 / ii / Paper 1 / 17G / c / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook