The geometry of t-spreads in k-walk-regular graphs
Visualitza/Obre
Cita com:
hdl:2117/8043
Tipus de documentArticle
Data publicació2010-08
EditorWiley InterScience
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
A graph is walk-regular if the number of closed walks of length
rooted at a given vertex is a constant through all the vertices for all .
For a walk-regular graph G with d+1 different eigenvalues and spectrally
maximum diameter D=d, we study the geometry of its d-spreads, 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 simplex (or tetrahedron in a three-dimensional case) and we
compute its parameters. Moreover, the results are generalized to the case
of k-walk-regular graphs, a family which includes both walk-regular and
distance-regular graphs, and their t-spreads or vertices at distance t from
each other.
CitacióDalfó Simó, C.; Fiol Mora, M.À.; Garriga Valle, E. The geometry of t-spreads in k-walk-regular graphs. "Journal of graph theory", Agost 2010, vol. 64, núm. 4, p. 312-322.
ISSN0364-9024
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Geometry-d-spreads-JGT.pdf | Article principal | 204,6Kb | Visualitza/Obre |