Cospectral pairs of regular graphs with different connectivity
From MaRDI portal
(Redirected from Publication:2296005)
Abstract: For vertex and edge connectivity we construct infinitely many pairs of regular graphs with the same spectrum, but with different connectivity.
Cites work
- 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
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Spectra of graphs
- Spectral bounds for the connectivity of regular graphs with given order
Cited in
(8)- The smallest pair of cospectral cubic graphs with different chromatic indexes
- On NP-hard graph properties characterized by the spectrum
- The \(\alpha \)-spectral radius of general hypergraphs
- Infinitely many pairs of cospectral integral regular graphs
- \(A_\alpha\) spectra of graphs obtained by two corona operations and \(A_\alpha\) cospectral graphs
- Constructions of cospectral graphs with different zero forcing numbers
- Connected graphs cospectral with a friendship graph
- A_ and L_-spectral properties of spider graphs
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)
