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

Title:	Algebraic characterizations of distance-regular graphs
Author:	Fiol Mora, Miquel Àngel
Other authors:	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV; Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
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.
Abstract:	Peer Reviewed
Subject(s):	-Graph theory -Distance-regular graph -Adjacency matrix -Spectrum -Grafs, Teoria de -Classificació AMS::05 Combinatorics::05C Graph theory
Rights:	Attribution-NonCommercial-NoDerivs 2.5 Spain http://creativecommons.org/licenses/by-nc-nd/2.5/es/
Document type:	Article
Published by:	Elsevier
Share: