scientific article; zbMATH DE number 1028230
The underlying problem considered in this chapter is the relation between the structure of a graph and various algebraic invariants, in particular, the spectrum of its adjacency matrix. The author describes necessary and sufficient conditions for a graph to be bipartite, regular, or strongly regular, for example, in terms of the spectrum. He then describes the use of linear algebra in developing feasibility tests for the existence of distance-regular graphs with given intersection arrays. The limitation of the information provided by the spectrum leads to the study of other invariants, in particular, to coordinate-free geometric attributes of eigenspaces. Certain structural properties of a graph can be expressed in terms of the eigenvalues and the angles between the coordinate axes and the eigenspaces. Finally, the author presents some results involving star partitions which give relations between individual eigenvalues and the structure of a graph. For the entire collection see [Zbl 0862.00008].
- Weakly distance-regular digraphs.
- Spectral bounds and distance-regularity
- On almost distance-regular graphs
- Geometric aspects of 2-walk-regular graphs
- On the spectrum of an extremal graph with four eigenvalues
- Algebraic characterizations of regularity properties in bipartite graphs
- On symmetric association schemes and associated quotient-polynomial graphs
- Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity
- On perturbations of almost distance-regular graphs
- On pseudo-distance-regularity
- Characterizing ( ,m)-walk-regular graphs
- On the combinatorial structure and algebraic characterizations of distance-regular digraphs
- The spectra of some families of digraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4342020)
