|Feb15-12, 02:33 PM||#1|
Can graph spectrums be derived from incident matrices?
Will the set of eigenvalues of an incident matrix derive an equivalent notion of a graph spectrum as it does with an adjacency matrix?
Let sa be the set of eigenvalues of an adjacency matrix for graph G.
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?
|Feb16-12, 08:19 PM||#2|
What is your definition for incident matrix? If it's the usual definition, then it's likely not a square (nxn) matrix so it doesn't make sense to talk about eigenvalues. You can however look at its singular values which I think are related to eigenvalues of the line graph of G.
|Similar Threads for: Can graph spectrums be derived from incident matrices?|
|Help with interpreting NMR and IR spectrums||Biology, Chemistry & Other Homework||0|
|Mathematica, Matrices and Graph Theory||Math & Science Software||3|
|Radiation Emission Spectrums for Alpha, Beta, and Gamma||Advanced Physics Homework||0|
|energy spectrums in QM||Differential Equations||8|
|absorption and reflectance spectrums||General Physics||2|