Graphs sharing an arbitrary number of ordered complementarity eigenvalues

DOI10.1016/j.disc.2023.113788OpenAlexW4388888665MaRDI QIDQ6136672

David Sossa, Vilmar Trevisan

Publication date: 17 January 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2023.113788

zbMATH Keywords

spectral determinationseparability indexcomplementary eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Locating the eigenvalues of trees
• Complementarity eigenvalue analysis of connected graphs
• Repetition of spectral radiuses among connected induced subgraphs
• On cardinality of complementarity spectra of connected graphs
• Determining graphs by the complementary spectrum
• Extremal problems involving the two largest complementarity eigenvalues of a graph
• Complementary eigenvalues of graphs
• Spectral ordering of trees with small index
• Spectral radius ordering of starlike trees
• Spectral radii of friendship graphs and their connected induced subgraphs

This page was built for publication: Graphs sharing an arbitrary number of ordered complementarity eigenvalues