Abstract
In this paper, we primarily focus on the eigenvalues of the adjacency matrix and Seidel matrix of chain graphs, referred to as eigenvalues and Seidel eigenvalues of these graphs, respectively. Firstly, we utilize the characteristic polynomial of the adjacency matrix of a chain graph to construct infinite pairs of non-isomorphic cospectral chain graphs. Next, we determine the inertia of the Seidel matrix of a chain graph and establish an interval that does not contain the Seidel eigenvalues of chain graphs. Lastly, we characterize chain graphs with distinct Seidel eigenvalues.
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.
