3,369 research outputs found
Distance-regular graphs
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 developments in the area of distance-regular
graphs since the monograph 'BCN' [Brouwer, A.E., Cohen, A.M., Neumaier, A.,
Distance-Regular Graphs, Springer-Verlag, Berlin, 1989] was written.Comment: 156 page
Taut distance-regular graphs and the subconstituent algebra
We consider a bipartite distance-regular graph with diameter at least
4 and valency at least 3. We obtain upper and lower bounds for the local
eigenvalues of in terms of the intersection numbers of and the
eigenvalues of . Fix a vertex of and let denote the corresponding
subconstituent algebra. We give a detailed description of those thin
irreducible -modules that have endpoint 2 and dimension . In an earlier
paper the first author defined what it means for to be taut. We obtain
three characterizations of the taut condition, each of which involves the local
eigenvalues or the thin irreducible -modules mentioned above.Comment: 29 page
The random graph
Erd\H{o}s and R\'{e}nyi showed the paradoxical result that there is a unique
(and highly symmetric) countably infinite random graph. This graph, and its
automorphism group, form the subject of the present survey.Comment: Revised chapter for new edition of book "The Mathematics of Paul
Erd\H{o}s
- β¦