An eigenvalue of a graph's Laplacian matrix. For a finite undirected graph, these eigenvalues are nonnegative, and the multiplicity of zero equals the number of connected components.

Ancestors (6)

  1. Laplacian matrix
  2. Graph theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6. 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