The geometry of t-spreads in k-walk-regular graphs
✍ Scribed by C. Dalfó; M. A. Fiol; E. Garriga
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 117 KB
- Volume
- 64
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
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. © 2009 Wiley Periodicals, Inc. J Graph Theory 64:312–322, 2010
📜 SIMILAR VOLUMES
## Abstract ## Objective To analyze spontaneous T cell spreading against determinants of the U1‐70K protein in young autoimmune MRL/__lpr__ lupus mice, in comparison with the T cell spreading occurring in normal BALB/c mice immunized with peptide 131–151 of this protein. ## Methods Peripheral bl
We discuss the results of experimental studies of ballistic electron transport in regular (i.e. non-chaotic) quantum dots. At low temperatures, coherent interference between electrons gives rise to reproducible fluctuations in the magneto-resistance, as well as to a weak localization peak near zero