Constructing families of cospectral regular graphs

DOI10.1017/S096354832000019XzbMath1462.05226arXiv2110.04985OpenAlexW3040425675MaRDI QIDQ4987254

Alex Newcombe, Michael Haythorpe

Publication date: 30 April 2021

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

infinite families of cospectral regular graphsremoval cospectral sets

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Vertex degrees (05C07)

Related Items (2)

On adjacency and Laplacian cospectral non-isomorphic signed graphs ⋮ Aα and Lα-spectral properties of spider graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cospectral graphs and regular orthogonal matrices of level 2
• Cospectral regular graphs with and without a perfect matching
• Constructing cospectral graphs
• Hamiltonian cycle problem and Markov chains.
• Genetic theory for cubic graphs

This page was built for publication: Constructing families of cospectral regular graphs