Exponentially many graphs have a \(Q\)-cospectral mate

DOI10.1016/j.disc.2017.04.009zbMath1365.05138OpenAlexW2614986369MaRDI QIDQ2359949

Bruna S. Souza, Vilmar Trevisan, João B. Carvalho, Fernando Colman Tura

Publication date: 23 June 2017

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

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

zbMATH Keywords

cospectral graphsthreshold graphsignless Laplacian matrix

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

No threshold graphs are cospectral ⋮ Characterizing threshold graphs with \(k\) main signless Laplacian eigenvalues ⋮ Determining graphs by the complementary spectrum ⋮ Constructing non-isomorphic signless Laplacian cospectral graphs ⋮ The characteristic polynomial of generalized lollipop graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connected graphs of fixed order and size with maximal \(Q\)-index: some spectral bounds
• Constructing cospectral graphs
• On a signless Laplacian spectral characterization of \(T\)-shape trees
• Signless Laplacians of finite graphs
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• Which graphs are determined by their spectrum?
• Enumeration of cospectral graphs.
• Threshold graphs and related topics
• Spectral characterizations of dumbbell graphs
• Towards a spectral theory of graphs based on the signless Laplacian, I
• Towards a spectral theory of graphs based on the signless Laplacian, III
• Graph isomorphism in quasipolynomial time [extended abstract]

This page was built for publication: Exponentially many graphs have a \(Q\)-cospectral mate