Algebraic characterizations of distance-regular graphs
نویسندگان
چکیده
منابع مشابه
Algebraic characterizations of distance-regular graphs
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.
متن کاملSpectral Characterizations of Some Distance-Regular Graphs
When can one see from the spectrum of a graph whether it is distance-regular or not? We give some new results for when this is the case. As a consequence we find (among others) that the following distance-regular graphs are uniquely determined by their spectrum: The collinearity graphs of the generalized octagons of order (2, 1), (3, 1) and (4, 1), the Biggs-Smith graph, the M22 graph, and the ...
متن کاملSome spectral and quasi-spectral characterizations of distance-regular graphs
This is a new contribution to the question: Can we see from the spectrum of a graph whether it is distance-regular? By generalizing some results of Van Dam and Haemers, among others, we give some new spectral and quasi-spectral characterizations of distance-regularity. In this area of research, typical results concluding that a graph is distance regular require that G is cospectral with a dista...
متن کاملCharacterizations of regular magic graphs
A graph is magic if the edges can be labeled with nonnegative real numbers such that (i) different edges have distinct labels, and (ii) the sum of the labels of edges incident to each vertex is the same. Regular magic graphs are characterized herein by the nonappearance of certain bipartite subgraphs. This implies that line connectivity is a crucial property for characterizing regular magic gra...
متن کاملEdge-distance-regular graphs are distance-regular
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-reg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00255-2