Loading...
Loading...

Go to the content (press return)

On almost distance-regular graphs

Author
Dalfo, C.; van Dam, E.; Fiol, M.; Garriga, E.; Gorissen, B.
Type of activity
Journal article
Journal
Journal of combinatorial theory. Series A
Date of publication
2010
Volume
118
Number
3
First page
1094
Last page
1113
DOI
https://doi.org/10.1016/j.jcta.2010.10.005 Open in new window
Repository
http://hdl.handle.net/2117/11111 Open in new window
Abstract
Distance-regular graphs are a key concept in Algebraic Combinatorics and have given rise to several generalizations, such as association schemes. Motivated by spectral and other algebraic characterizations of distance-regular graphs, we study ‘almost distanceregular graphs’. We use this name informally for graphs that share some regularity properties that are related to distance in the graph. For example, a known characterization of a distance-regular graph is the invariance of the number of...
Citation
Dalfo, C. [et al.]. On almost distance-regular graphs. "Journal of combinatorial theory. Series A", 2010.
Keywords
Distance-regular graph, Eigenvalues, Local multiplicities, Predistance polynomial, Walk-regular graph
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants