Loading...
Loading...

Go to the content (press return)

When almost distance-regularity attains distance-regularity

Author
Dalfo, C.; van Dam, E.; Fiol, M.; Garriga, E.
Type of activity
Presentation of work at congresses
Name of edition
8th French Combinatorial Conference
Date of publication
2010
Presentation's date
2010-06-28
Book of congress proceedings
8th French Combinatorial Conference
First page
99
Last page
99
Repository
http://hdl.handle.net/2117/8048 Open in new window
Abstract
Generally speaking, `almost distance-regular graphs' are graphs which share some, but not necessarily all, regularity properties that characterize distance-regular graphs. In this paper we rst propose four basic di erent (but closely related) concepts of almost distance-regularity. In some cases, they coincide with concepts introduced before by other authors, such as walk-regular graphs and partially distance-regular graphs. Here it is always assumed that the diameter D of the graph attains its...
Citation
Dalfo, C. [et al.]. When almost distance-regularity attains distance-regularity. A: 8th French Combinatorial Conference. "8th French Combinatorial Conference". Orsay, París: 2010, p. 99.
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants

Attachments