- #1
1Truthseeker
- 43
- 0
Will the set of eigenvalues of an incident matrix derive an equivalent notion of a graph spectrum as it does with an adjacency matrix?
Specifically:
Let sa be the set of eigenvalues of an adjacency matrix for graph G.
And,
Let si be the set of eigenvalues of an incident matrix for graph G.
What are the differences between sa and si? Could these both be considered spectrums of the graph? If not, why?
Thanks much!
Specifically:
Let sa be the set of eigenvalues of an adjacency matrix for graph G.
And,
Let si be the set of eigenvalues of an incident matrix for graph G.
What are the differences between sa and si? Could these both be considered spectrums of the graph? If not, why?
Thanks much!