Edge-distance-regular graphs are distance-regular

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

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

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.contributor	Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.contributor.author	Cámara Vallejo, Marc
dc.contributor.author	Dalfó Simó, Cristina
dc.contributor.author	Delorme, Charles
dc.contributor.author	Fiol Mora, Miquel Àngel
dc.contributor.author	Suzuki, Hiroshi
dc.date	2013
dc.identifier.citation	Cámara, M. [et al.]. Edge-distance-regular graphs are distance-regular. "Journal of combinatorial theory. Series A", 2013, vol. 120, núm. 5, p. 1057-1067.
dc.identifier.citation	0097-3165
dc.identifier.citation	10.1016/j.jcta.2013.02.006
dc.identifier.uri	http://hdl.handle.net/2117/22307
dc.language.iso	eng
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
dc.subject	Graph theory
dc.subject	Grafs, Teoria de
dc.title	Edge-distance-regular graphs are distance-regular
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/article
dc.description.abstract	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 homogeneous. More precisely, Γ 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.

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author