Cospectral mates for generalized Johnson and Grassmann graphs

We provide three infinite families of graphs in the Johnson and Grassmann schemes that are not uniquely determined by their spectrum. We do so by constructing graphs that are cospectral but non-isomorphic to these graphs.

Detalles Bibliográficos
Autores: Abiad Monge, Aida, D'haeseleer, Jozefien, Haemers, Willem H., Simoens, Robin Nicolas|||0000-0001-7398-3085
Tipo de recurso: artículo
Fecha de publicación:2023
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/396615
Acceso en línea:https://hdl.handle.net/2117/396615
https://dx.doi.org/10.1016/j.laa.2023.08.015
Access Level:acceso abierto
Palabra clave:Graph
Eigenvalues
Determined by spectrum
Switching
Classificació AMS::05 Combinatorics::05C Graph theory
Classificació AMS::15 Linear and multilinear algebra
matrix theory
Àrees temàtiques de la UPC::Matemàtiques i estadística
Descripción
Sumario:We provide three infinite families of graphs in the Johnson and Grassmann schemes that are not uniquely determined by their spectrum. We do so by constructing graphs that are cospectral but non-isomorphic to these graphs.