Cospectral pairs of regular graphs with different connectivity

DOI10.7151/DMGT.2278MaRDI QIDQ2296005zbMATHOpenAlexWikidataFDO

Authors Willem H. Haemers

Publication date 17 February 2020

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

Full work available at URL https://arxiv.org/abs/1904.05936

zbMATH Keywords

graph spectrumvertex connectivityspectral characterizationedge connectivity

Mathematics Subject Classification ID

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

Abstract: For vertex and edge connectivity we construct infinitely many pairs of regular graphs with the same spectrum, but with different connectivity.

Cites work

• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• An introduction to the theory of graph spectra
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Constructing cospectral graphs
• Cospectral regular graphs with and without a perfect matching
• Distance-regularity and the spectrum of graphs
• Eigenvalues and edge-connectivity of regular graphs
• Graphs cospectral with distance-regular graphs
• Spectra of graphs
• Spectral bounds for the connectivity of regular graphs with given order

Cited in

(8)

• Infinitely many pairs of cospectral integral regular graphs
• The \(\alpha \)-spectral radius of general hypergraphs
• Connected graphs cospectral with a friendship graph
• \(A_\alpha\) spectra of graphs obtained by two corona operations and \(A_\alpha\) cospectral graphs
• \(A_\alpha\) and \(L_\alpha\)-spectral properties of spider graphs
• On NP-hard graph properties characterized by the spectrum
• The smallest pair of cospectral cubic graphs with different chromatic indexes
• Constructions of cospectral graphs with different zero forcing numbers

This page was built for publication: Cospectral pairs of regular graphs with different connectivity

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