To access the full text documents, please follow this link: http://hdl.handle.net/2117/22307

Edge-distance-regular graphs are distance-regular
Cámara Vallejo, Marc; Dalfó Simó, Cristina; Delorme, Charles; Fiol Mora, Miquel Àngel; Suzuki, Hiroshi
Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV; Universitat Politècnica de Catalunya. COMBGRAF - Combinatòria, Teoria de Grafs i Aplicacions
Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
Graph theory
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 G is distance-regular and homogeneous. More precisely
G is edge-distance-regular if and only if it is bipartite distance-regular or a generalized odd graph. Also
we obtain the relationships between some of their corresponding parameters
mainly
the distance polynomials and the intersection numbers.
Grafs, Teoria de
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
info:eu-repo/semantics/publishedVersion
Article
         

Show full item record

Related documents

Other documents of the same author

Cámara Vallejo, Marc; Dalfó Simó, Cristina; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Cámara Vallejo, Marc; Dalfó Simó, Cristina; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Cámara Vallejo, Marc; Dalfó Simó, Cristina; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Cámara Vallejo, Marc; Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest
Fiol Mora, Miquel Àngel; Garriga Valle, Ernest; Fàbrega Canudas, José; Cámara Vallejo, Marc
 

Coordination

 

Supporters