[LIBRO][B] Spectra of graphs

AE Brouwer, WH Haemers - 2011 - books.google.com
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 …

[LIBRO][B] Design Theory: Volume 1

T Beth, D Jungnickel, H Lenz - 1999 - books.google.com
This is the first volume of a two-volume text on design theory. Since the first edition, there
has been extensive development of the theory. In particular, the growing importance of …

Which graphs are determined by their spectrum?

ER Van Dam, WH Haemers - Linear Algebra and its applications, 2003 - Elsevier
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 …

Interlacing eigenvalues and graphs

WH Haemers - Linear Algebra and its applications, 1995 - Elsevier
We give several old and some new applications of eigenvalue interlacing to matrices
associated to graphs. Bounds are obtained for characteristic numbers of graphs, such as the …

Distance-regular graphs

ER Van Dam, JH Koolen, H Tanaka - arxiv preprint arxiv:1410.6294, 2014 - arxiv.org
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 …

Strongly regular graphs

AE Brouwer, WH Haemers, AE Brouwer, WH Haemers - Spectra of graphs, 2012 - Springer
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 …

[LIBRO][B] Strongly regular graphs

AE Brouwer, H Van Maldeghem - 2022 - books.google.com
Strongly regular graphs lie at the intersection of statistical design, group theory, finite
geometry, information and coding theory, and extremal combinatorics. This monograph …

Regular graphs with four eigenvalues

ER van Dam - Linear algebra and its applications, 1995 - Elsevier
Regular Graphs With Four Eigenvalues Page 1 Regular Graphs With Four Eigenvalues Edwin R.
van Dam Tilburg University Department of Econometrics PO Box 90153 5000 LE Tilburg The …

On the p-Rank of the Adjacency Matrices of Strongly Regular Graphs

AE Brouwer, CA Van Eijl - Journal of Algebraic Combinatorics, 1992 - Springer
Let Γ be a strongly regular graph with adjacency matrix A. Let I be the identity matrix, and J
the all-1 matrix. Let p be a prime. Our aim is to study the p-rank (that is, the rank over F _p …

Experimental study of energy-minimizing point configurations on spheres

B Ballinger, G Blekherman, H Cohn… - Experimental …, 2009 - Taylor & Francis
In this paper we report on massive computer experiments aimed at finding spherical point
configurations that minimize potential energy. We present experimental evidence for two …