Dual concepts of almost distance-regularity and the spectral excess theorem

Generally speaking, `almost distance-regular' graphs share some, but not necessarily all, of the regularity properties that characterize distance-regular graphs. In this paper we propose two new dual concepts of almost distance-regularity, thus giving a better understanding of the properties of distance-regular graphs. More precisely, we characterize $m$-partially distance-regular graphs and $j$-punctually eigenspace distance-regular graphs by using their spectra. Our results can also be seen as a generalization of the so-called spectral excess theorem for distance-regular graphs, and they lead to a dual version of it

Dual concepts of almost distance-regularity and the spectral excess theorem

Generally speaking, ‘almost distance-regular’ graphs are graphs that share some, but not necessarily all, regularity properties that characterize distance-regular graphs. In this paper we first propose two dual concepts of almost distance-regularity. In some cases, they coincide with concepts introduced before by other authors, such as partially distance-regular graphs. Our study focuses on finding out when almost distance-regularity leads to distance-regularity. In particular, some ‘economic’ (in the sense of minimizing the number of conditions) old and new characterizations of distance-regularity are discussed. Moreover, other characterizations based on the average intersection numbers and the recurrence coefficients are obtained. In some cases, our results can also be seen as a generalization of the so-called spectral excess theorem for distance-regular graphs.Peer Reviewe

Proceedings of the 3rd International Workshop on Optimal Networks Topologies IWONT 2010

Peer Reviewe

A spectral excess theorem for digraphs with normal Laplacian matrices

The spectral excess theorem‎, ‎due to Fiol and Garriga in 1997‎, ‎is an important result‎, ‎because it gives a good characterization‎ ‎of distance-regularity in graphs‎. ‎Up to now‎, ‎some authors have given some variations of this theorem‎. ‎Motivated by this‎, ‎we give the corresponding result by using the Laplacian spectrum for digraphs‎. ‎We also illustrate this Laplacian spectral excess theorem for digraphs with few Laplacian eigenvalues and we show that any strongly connected and regular digraph that has normal Laplacian matrix with three distinct eigenvalues‎, ‎is distance-regular‎. ‎Hence such a digraph is strongly regular with girth $g=2$ or $g=3$‎

Dual concepts of almost distance-regularity and the spectral excess theorem

Generally speaking, ‘almost distance-regular’ graphs share some, but not necessarily all, of the regularity properties that characterize distance-regular graphs. In this paper we propose two new dual concepts of almost distance-regularity, thus giving a better understanding of the properties of distance-regular graphs. More precisely, we characterize m-partially distance-regular graphs and j-punctually eigenspace distance-regular graphs by using their spectra. Our results can also be seen as a generalization of the so-called spectral excess theorem for distance-regular graphs, and they lead to a dual version of it

Dual concepts of almost distance-regularity and the spectral excess theorem

Generally speaking, ‘almost distance-regular’ graphs are graphs that share some, but not necessarily all, regularity properties that characterize distance-regular graphs. In this paper we first propose two dual concepts of almost distance-regularity. In some cases, they coincide with concepts introduced before by other authors, such as partially distance-regular graphs. Our study focuses on finding out when almost distance-regularity leads to distance-regularity. In particular, some ‘economic’ (in the sense of minimizing the number of conditions) old and new characterizations of distance-regularity are discussed. Moreover, other characterizations based on the average intersection numbers and the recurrence coefficients are obtained. In some cases, our results can also be seen as a generalization of the so-called spectral excess theorem for distance-regular graphs.Peer Reviewe

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