Abstract
Two emerging topics in graph theory are the study of cospectral vertices of a graph, and the study of isospectral reductions of graphs. In this paper, we prove a fundamental relationship between these two areas, which is that two vertices of a graph are cospectral if and only if the isospectral reduction over these vertices has a nontrivial automorphism. It is well known that if two vertices of a graph are symmetric, i.e. if there exists a graph automorphism permuting these two vertices, then they are cospectral. This paper extends this result showing that any two cospectral vertices are symmetric in some reduced version of the graph. We also prove that two vertices are strongly cospectral if and only if they are cospectral and the isospectral reduction over these two vertices has simple eigenvalues. We further describe how these results can be used to construct new families of graphs with cospectral vertices.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
