A unified criterion for distinguishing graphs by their spectral radius

DOI10.1080/03081087.2023.2228458MaRDI QIDQ6608150zbMATH OpenFDO

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)

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Eigenvalues, singular values, and eigenvectors (15A18)

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

Cites work

• Complementarity eigenvalue analysis of connected graphs
• Complementary eigenvalues of graphs
• Determining graphs by the complementary spectrum
• Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions
• Extremal problems involving the two largest complementarity eigenvalues of a graph
• Indices for special classes of trees
• Indices of trees with a prescribed diameter
• Integer index in trees of diameter 4
• On cardinality of complementarity spectra of connected graphs
• On the eigenvalues and spectral radius of starlike trees
• Repetition of spectral radiuses among connected induced subgraphs
• Spectra of graphs
• Spectral radii of friendship graphs and their connected induced subgraphs
• Spectral radius ordering of starlike trees
• The characteristic polynomial of a graph
• Which graphs are determined by their spectrum?

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)