Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Can graph spectrums be derived from incident matrices?

  1. Feb 15, 2012 #1
    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!
     
  2. jcsd
  3. Feb 16, 2012 #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.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Can graph spectrums be derived from incident matrices?
  1. Derivation of Matrices (Replies: 5)

Loading...