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 …

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 …

We study (symmetric) three-class association schemes. The graphs with four distinct
eigenvalues which are one of the relations of such a scheme are characterized. We also …

Q-integral graphs with edge–degrees at most five - ScienceDirect Skip to main contentSkip to
article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …

Two standard matrix representations of a graph are the adjacency matrix and the Laplace
matrix. The eigenvalues of these matrices are interesting parameters of the graph. Graphs …

A divisible design graph is a graph whose adjacency matrix is the incidence matrix of a
divisible design. Divisible design graphs are a natural generalization of (v, k, λ)-graphs, and …

Written for mathematicians working with the theory of graph spectra, this (primarily
theoretical) book presents relevant results considering the spectral properties of regular …

In this paper Seidel matrices are studied, and their spectrum and several related algebraic
properties are determined for order n≤ 13. Based on this Seidel matrices with exactly three …

We present a method which in principal allows to characterise all integral circulant graphs
with multiplicative divisor set having a spectrum, ie the set of distinct eigenvalues, of any …