Cospectral pairs of regular graphs with different connectivity

DOI10.7151/dmgt.2278zbMath1433.05195arXiv1904.05936OpenAlexW2997105615WikidataQ126431545 ScholiaQ126431545MaRDI QIDQ2296005

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

vertex connectivitygraph spectrumspectral characterizationedge connectivity

Mathematics Subject Classification ID

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

Related Items (6)

Aα spectra of graphs obtained by two corona operations and Aα cospectral graphs ⋮ The \(\alpha \)-spectral radius of general hypergraphs ⋮ On NP-hard graph properties characterized by the spectrum ⋮ Constructions of cospectral graphs with different zero forcing numbers ⋮ The smallest pair of cospectral cubic graphs with different chromatic indexes ⋮ Aα and Lα-spectral properties of spider graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Cospectral regular graphs with and without a perfect matching
• Constructing cospectral graphs
• Spectra of graphs
• Eigenvalues and edge-connectivity of regular graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Distance-regularity and the spectrum of graphs
• Spectral Bounds for the Connectivity of Regular Graphs with Given Order
• Graphs cospectral with distance-regular graphs

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