Search ResultsShowing 1-2 of 2
-
arXiv:1207.3606 (Published 2012-07-16)
Dual concepts of almost distance-regularity and the spectral excess theorem
Journal: Discrete Math. 312 (2012), 2730--2734Categories: math.COKeywords: spectral excess theorem, dual concepts, distance-regularity, punctually eigenspace distance-regular graphs, characterize distance-regular graphsTags: journal articleGenerally 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.
-
arXiv:1202.3265 (Published 2012-02-15)
On almost distance-regular graphs
Journal: Journal of Combinatorial Theory, Series A 118 (2011), 1094-1113Categories: math.COKeywords: distance-regular graph, walk-regularity, characterization, symmetric cubic graphs, spectral excess theoremTags: journal articleDistance-regular graphs are a key concept in Algebraic Combinatorics and have given rise to several generalizations, such as association schemes. Motivated by spectral and other algebraic characterizations of distance-regular graphs, we study `almost distance-regular graphs'. We use this name informally for graphs that share some regularity properties that are related to distance in the graph. For example, a known characterization of a distance-regular graph is the invariance of the number of walks of given length between vertices at a given distance, while a graph is called walk-regular if the number of closed walks of given length rooted at any given vertex is a constant. One of the concepts studied here is a generalization of both distance-regularity and walk-regularity called $m$-walk-regularity. Another studied concept is that of $m$-partial distance-regularity or, informally, distance-regularity up to distance $m$. Using eigenvalues of graphs and the predistance polynomials, we discuss and relate these and other concepts of almost distance-regularity, such as their common generalization of $(\ell,m)$-walk-regularity. We introduce the concepts of punctual distance-regularity and punctual walk-regularity as a fundament upon which almost distance-regular graphs are built. We provide examples that are mostly taken from the Foster census, a collection of symmetric cubic graphs. Two problems are posed that are related to the question of when almost distance-regular becomes whole distance-regular. We also give several characterizations of punctually distance-regular graphs that are generalizations of the spectral excess theorem.