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 …

Which graphs are determined by their spectrum? Page 1 Linear Algebra and its Applications
373 (2003) 241–272 www.elsevier.com/locate/laa Which graphs are determined by their …

This in-depth coverage of important areas of graph theory maintains a focus on symmetry
properties of graphs. Standard topics on graph automorphisms are presented early on, while …

Line graphs have the property that their least eigenvalue is greater than or equal to-2, a
property shared by generalized line graphs and a finite number of so-called exceptional …

Signed graphs are graphs whose edges get a sign $+ 1$ or $-1$(the signature). Signed
graphs can be studied by means of graph matrices extended to signed graphs in a natural …

We consider the discrete-time dynamics of a network of agents that exchange information
according to a nearest-neighbour protocol under which all agents are guaranteed to reach …

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 …

We obtain several new results contributing to the theory of real equiangular line systems.
Among other things, we present a new general lower bound on the maximum number of …

Let G be a connected graph and D (G) be the distance matrix of G. Suppose that λ 1 (D)⩾ λ 2
(D)⩾⋯⩾ λ n (D) are the D-eigenvalues of G. In this paper, we characterize all connected …

Some well-known graph irregularity indices of a connected graph G are investigated. Our
study is focused mainly on the comparison of the Bell's degree-variance (Var (G)) and the …