Skip to main content
MathOverflow

Return to Answer

added 3 characters in body
Source Link
kastberg
kastberg
  • 123
  • 6

There's a whole area of algebraic graph theory, but without any information on a the graph, I can't remember anything graph specific right now

What is relevant is Gershgorin circle theorem

Which for example would mean that a undirected graph without loops, the adjacency matrix would have eigenvalues smaller than the maximum linksdegree of a vertex, that is |M||M-1|. And for the Laplacian we should get something like 2|M|.

There's a whole area of algebraic graph theory, but without any information on a the graph, I can't remember anything graph specific right now

What is relevant is Gershgorin circle theorem

Which for example would mean that a undirected graph without loops, the adjacency matrix would have eigenvalues smaller than the maximum links of a vertex, that is |M|. And for the Laplacian we should get something like 2|M|.

There's a whole area of algebraic graph theory, but without any information on a the graph, I can't remember anything graph specific right now

What is relevant is Gershgorin circle theorem

Which for example would mean that a undirected graph without loops, the adjacency matrix would have eigenvalues smaller than the maximum degree of a vertex, that is |M-1|. And for the Laplacian we should get something like 2|M|.

Source Link
kastberg
kastberg
  • 123
  • 6

There's a whole area of algebraic graph theory, but without any information on a the graph, I can't remember anything graph specific right now

What is relevant is Gershgorin circle theorem

Which for example would mean that a undirected graph without loops, the adjacency matrix would have eigenvalues smaller than the maximum links of a vertex, that is |M|. And for the Laplacian we should get something like 2|M|.