The Spectral Excess Theorem for Distance-Biregular Graphs.
Keyword(s):
The spectral excess theorem for distance-regular graphs states that a regular (connected) graph is distance-regular if and only if its spectral-excess equals its average excess. A bipartite graph $\Gamma$ is distance-biregular when it is distance-regular around each vertex and the intersection array only depends on the stable set such a vertex belongs to. In this note we derive a new version of the spectral excess theorem for bipartite distance-biregular graphs.
2019 ◽
Vol 12
(07)
◽
pp. 2050009
Keyword(s):
2019 ◽
Vol 16
◽
pp. 1254-1259
Keyword(s):
2021 ◽
Vol 28
(3)
◽
pp. 38-48
2000 ◽
Vol 23
(2)
◽
pp. 89-97
◽
2001 ◽
Vol 10
(2)
◽
pp. 127-135
◽