Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

In Gephi I visualized a graph to calculate the eigenvalues,then I choose a portion of graph (e.g 6 vertex with their edges) and delete all others. I calculate the eigenvalues again and noticed that I get the same result.By same result I mean same ranking but with different values. The question is if this is happens by chance(I tried three times) or there is a mathematical fact back of it? If yes, what theorem should I search for? or if anybody can explain here and give a proof of it I'll be appreciate it.

Thanks alot, Behzad

share|cite|improve this question
up vote 3 down vote accepted

Yes. The adjacency matrix for the subgraph is a principle submatrix of the adjacency matrix of the entire graph, so the eigenvalues will be related by interlacing inequalities. Here is one paper that discusses these inequalities and some graph-theoretic results derived from them.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.