Algebraic characterizations of distance-regular graphs

All of RECERCAT

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

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	Fiol Mora, Miquel Àngel
dc.date	2001
dc.identifier.citation	Fiol, M.A. "Algebraic characterizations of distance-regular graphs". Discrete Mathematics, 2002, vol. 246, núm. 1-3, p. 111-129
dc.identifier.uri	http://hdl.handle.net/2117/2238
dc.language.iso	eng
dc.publisher	Elsevier
dc.rights	Attribution-NonCommercial-NoDerivs 2.5 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/2.5/es/
dc.subject	Graph theory
dc.subject	Distance-regular graph
dc.subject	Adjacency matrix
dc.subject	Spectrum
dc.subject	Grafs, Teoria de
dc.subject	Classificació AMS::05 Combinatorics::05C Graph theory
dc.title	Algebraic characterizations of distance-regular graphs
dc.type	info:eu-repo/semantics/article
dc.description.abstract	We survey some old and some new characterizations of distance-regular graphs, which depend on information retrieved from their adjacency matrix. In particular, it is shown that a regular graph with d+1 distinct eigenvalues is distance-regular if and only if a numeric equality, involving only the spectrum of the graph and the numbers of vertices at distance d from each vertex, is satisfied.
dc.description.abstract	Peer Reviewed