Abstract
Let G (resp. Gn) be the set of connected graphs (resp. with n vertices) whose eigenvalues are mutually distinct, and G∗ (resp. Gn∗) the set of connected graphs (resp. with n vertices) whose eigenvalues are mutually distinct and main. Two graphs G and H are said to be cospectral if they share the same adjacency spectrum. In this paper, we give a new method to construct infinite families of graphs in G and G∗. Concretely, given a graph G in Gn or Gn∗, the infinite families of G or G∗ are constructed from G, and furthermore the spectra of such graphs are also characterized by the spectrum of G. By the way, we use this method to construct some infinite families of non-isomorphic cospectral graphs, especially, including the graphs in G and G∗.
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.
