Graphs sharing an arbitrary number of ordered complementarity eigenvalues

DOI10.1016/J.DISC.2023.113788MaRDI QIDQ6136672zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• New results on complementarity spectra of connected graphs
• Complementarity eigenvalues and graph determination
• Complementarity eigenvalue analysis of connected graphs
• Complementary eigenvalues of graphs
• Complementarity spectrum of digraphs

Cites work

• scientific article; zbMATH DE number 3627232 (Why is no real title available?)
• scientific article; zbMATH DE number 3411062 (Why is no real title available?)
• Complementarity eigenvalue analysis of connected graphs
• Complementarity eigenvalues and graph determination
• Complementary eigenvalues of graphs
• Determining graphs by the complementary spectrum
• Extremal problems involving the two largest complementarity eigenvalues of a graph
• Locating the eigenvalues of trees
• On cardinality of complementarity spectra of connected graphs
• Repetition of spectral radiuses among connected induced subgraphs
• Spectral ordering of trees with small index
• Spectral radii of friendship graphs and their connected induced subgraphs
• Spectral radius ordering of starlike trees

Cited in

(2)

• New results on complementarity spectra of connected graphs
• A unified criterion for distinguishing graphs by their spectral radius

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136672)