Determining graphs by the complementary spectrum

DOI10.7151/dmgt.2280zbMath1433.05205OpenAlexW2998563586WikidataQ126434044 ScholiaQ126434044MaRDI QIDQ2296010

Vilmar Trevisan, Bruna S. Souza, Lucélia Kowalski Pinheiro

Publication date: 17 February 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2280

zbMATH Keywords

graph isomorphismcomplementary eigenvalues

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (8)

Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues ⋮ Repetition of spectral radiuses among connected induced subgraphs ⋮ Spectral radii of friendship graphs and their connected induced subgraphs ⋮ Unnamed Item ⋮ Graphs sharing an arbitrary number of ordered complementarity eigenvalues ⋮ New results on complementarity spectra of connected graphs ⋮ Enumeration of cospectral and coinvariant graphs ⋮ Complementarity spectrum of digraphs

Cites Work

• Constructing cospectral graphs
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• Developments on spectral characterizations of graphs
• Which graphs are determined by their spectrum?
• Complementarity eigenvalue analysis of connected graphs
• Complementary eigenvalues of graphs
• Exponentially many graphs have a \(Q\)-cospectral mate
• On the structure of bidegreed graphs with minimal spectral radius
• Towards a spectral theory of graphs based on the signless Laplacian, I
• Towards a spectral theory of graphs based on the signless Laplacian, III
• Spectral radius ordering of starlike trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Determining graphs by the complementary spectrum