Hi all,(adsbygoogle = window.adsbygoogle || []).push({});

I would like to ask about the eigenvalues of adjacency matrices of a simple undirected unweighted graph. I am mainly interested in the largest and second largest eigenvalues of a graph. From what I have read, it seems that the first eigenvalue gives an estimate on the average degree of the vertices, while the difference between the largest and second largest eigenvalue can tell us something interesting but I am not really sure what.

The main point of my question, I was wondering, suppose we are not given the original graph, but we are given the first and second eigenvalues of the adjacency matrix. Are there any interesting deductions or observations we can make about the graph?

Thank you very much!

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Regarding Eigenvalues of Adjacency Matrices

Can you offer guidance or do you also need help?

Draft saved
Draft deleted

Loading...

Similar Threads for Regarding Eigenvalues Adjacency |
---|

A Eigenvalues and matrix entries |

A Eigenvalue Problem and the Calculus of Variations |

I Eigenvalues of Circulant matrices |

I Eigenvalues of block matrices |

A Numerically Calculating Eigenvalues |

**Physics Forums | Science Articles, Homework Help, Discussion**