dc.contributor.author Fiol Mora, Miquel Àngel dc.contributor.other Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV dc.date.accessioned 2008-09-05T12:36:46Z dc.date.available 2008-09-05T12:36:46Z dc.date.created 2001 dc.date.issued 2002 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.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.format.extent 20 p. dc.language.iso eng dc.publisher Elsevier dc.rights Attribution-NonCommercial-NoDerivs 2.5 Spain dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/2.5/es/ dc.subject.lcsh Graph theory dc.subject.other Distance-regular graph dc.subject.other Adjacency matrix dc.subject.other Spectrum dc.title Algebraic characterizations of distance-regular graphs dc.type Article dc.subject.lemac Grafs, Teoria de dc.contributor.group Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions dc.description.peerreviewed Peer Reviewed dc.subject.ams Classificació AMS::05 Combinatorics::05C Graph theory dc.rights.access Open Access local.personalitzacitacio true
﻿