Carregant...
Carregant...

Vés al contingut (premeu Retorn)

On t-cliques in k-walk-regular graphs

Autor
Dalfo, C.; Fiol, M.; Garriga, E.
Tipus d'activitat
Article en revista
Revista
Electronic notes in discrete mathematics
Data de publicació
2009-08
Volum
34
Pàgina inicial
579
Pàgina final
584
DOI
https://doi.org/10.1016/j.endm.2009.07.096 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/8041 Obrir en finestra nova
Resum
A graph is walk-regular if the number of cycles of length rooted at a given vertex is a constant through all the vertices. For a walk-regular graph G with d+1 different eigenvalues and spectrally maximum diameter D = d, we study the geometry of its d-cliques, that is, the sets of vertices which are mutually at distance d. When these vertices are projected onto an eigenspace of its adjacency matrix, we show that they form a regular tetrahedron and we compute its parameters. Moreover, the result...
Citació
Dalfo, C.; Fiol, M. A.; Garriga, E. On t-cliques in k-walk-regular graphs. "Electronic notes in discrete mathematics", Agost 2009, vol. 34, p. 579-584.
Paraules clau
Clique, Distance-regular graphs, Spectrum, k-Walk-regular graphs
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Participants