A unified criterion for distinguishing graphs by their spectral radius
From MaRDI portal
Publication:6608150
DOI10.1080/03081087.2023.2228458zbMATH Open1547.05177MaRDI QIDQ6608150FDOQ6608150
Authors: Siddiqui Merajuddin, Pawan Kumar, Shariefuddin Pirzada, Vilmar Trevisan 
Publication date: 19 September 2024
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Recommendations
- Repetition of spectral radiuses among connected induced subgraphs
- Graphs sharing an arbitrary number of ordered complementarity eigenvalues
- Complementarity eigenvalues and graph determination
- Determining graphs by the complementary spectrum
- On cardinality of complementarity spectra of connected graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Spectra of graphs
- Which graphs are determined by their spectrum?
- Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions
- Indices for special classes of trees
- The characteristic polynomial of a graph
- Integer index in trees of diameter 4
- On the eigenvalues and spectral radius of starlike trees
- Determining graphs by the complementary spectrum
- Indices of trees with a prescribed diameter
- Spectral radius ordering of starlike trees
- Complementarity eigenvalue analysis of connected graphs
- Complementary eigenvalues of graphs
- Repetition of spectral radiuses among connected induced subgraphs
- Extremal problems involving the two largest complementarity eigenvalues of a graph
- On cardinality of complementarity spectra of connected graphs
- Spectral radii of friendship graphs and their connected induced subgraphs
This page was built for publication: A unified criterion for distinguishing graphs by their spectral radius
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608150)
