Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Distance-regular graphs where the distance-d graph has fewer distinct eigenvalues

Autor
Fiol, M.; Brouwer, A.
Tipus d'activitat
Article en revista
Revista
Linear algebra and its applications
Data de publicació
2015-05-16
Volum
480
Pàgina inicial
115
Pàgina final
126
DOI
https://doi.org/10.1016/j.laa.2015.04.020 Obrir en finestra nova
Projecte finançador
2009SGR1387
Optimización y problemas extremales en teoria de grafos y combinatoria. Aplicacions a les redes de comunicación
Repositori
http://hdl.handle.net/2117/28555 Obrir en finestra nova
Resum
Let the Kneser graph K of a distance-regular graph $\Gamma$ be the graph on the same vertex set as $\Gamma$, where two vertices are adjacent when they have maximal distance in $\Gamma$. We study the situation where the Bose-Mesner algebra of $\Gamma$ is not generated by the adjacency matrix of K. In particular, we obtain strong results in the so-called `half antipodal' case.
Citació
Fiol, M.; Brouwer, A. Distance-regular graphs where the distance-d graph has fewer distinct eigenvalues. "Linear algebra and its applications", 2015, vol. 480, p. 115-126.
Paraules clau
Bose-Mesner algebra, Distance-regular graph, Kneser graph, half-antipodality.
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Participants

Arxius