Edge-distance-regular graphs are distance-regular

A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give some (combinatorial and algebraic) proofs of the fact that every edge-distance-regular graph Γ is distance-regular and ho...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of combinatorial theory. Series A 2013-07, Vol.120 (5), p.1057-1067
Hauptverfasser:	Cámara, M., Dalfó, C., Delorme, C., Fiol, M.A., Suzuki, H.
Format:	Artikel
Sprache:	eng
Schlagworte:	Bipartite distance-regular graph Edge-distance-regular graph Generalized odd graph Grafs, Teoria de Graph theory Homogeneous graph Matemàtica discreta Matemàtiques i estadística Orthogonal polynomials Teoria de grafs Àrees temàtiques de la UPC
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!