This book gives an elementary treatment of the basic material about graph spectra, both for
ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering …

Algebraic graph theory is a fascinating subject concerned with the interplay between
algebra and graph theory. Algebraic tools can be used to give surprising and elegant proofs …

Algebraic combinatorics is the study of combinatorial objects as an extension of the study of
finite permutation groups, or, in other words, group theory without groups. In the spirit of …

Association schemes were originally introduced by Bose and his co-workers in the design of
statistical experiments. Since that point of inception, the concept has proved useful in the …

This is a survey of distance-regular graphs. We present an introduction to distance-regular
graphs for the reader who is unfamiliar with the subject, and then give an overview of some …

In [ER van Dam, WH Haemers, Which graphs are determined by their spectrum? Linear
Algebra Appl. 373 (2003), 241–272] we gave a survey of answers to the question of which …

Strongly Regular Graphs Page 1 Chapter 9 Strongly Regular Graphs 9.1 Strongly regular
graphs A graph (simple, undirected, and loopless) of order v is called strongly regular with …

This book provides an introduction to the inverse eigenvalue problem for graphs (IEP-$ G $)
and the related area of zero forcing, propagation, and throttling. The IEP-$ G $ grew from the …

Let G be a connected graph on n vertices. For a vertex u∈ G, the eccentricity of u is defined
as ε (u)= max⁡{d (u, v)| v∈ V (G)}, where d (u, v) denotes the distance between u and v. The …

There are only finitely many distance-regular graphs of fixed valency greater than two -
ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books Search …