If a regular graph has connected components, the indicator vector of each component is a -eigenvector. They are linearly independent, and the Laplacian argument shows that every such eigenvector is constant on each component. Therefore its multiplicity is exactly , in particular greater than one.

Ancestors (10)

  1. 16H
  2. Paper 4
  3. ii
  4. 2017
  5. Past exam of the mathematics course of the University of Cambridge
  6. Mathematics course of the University of Cambridge
  7. Course of the University of Cambridge
  8. University of Cambridge
  9. List of universities
  10. Home

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