The spectral excess theorem for distance-biregular graphs. (Q396831)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6330293
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The spectral excess theorem for distance-biregular graphs. |
scientific article; zbMATH DE number 6330293 |
Statements
The spectral excess theorem for distance-biregular graphs. (English)
0 references
14 August 2014
0 references
Summary: 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.
0 references
distance-biregular graph
0 references
spectral excess theorem
0 references
orthogonal polynomials
0 references
0 references
0.8784573078155518
0 references
0.8749344944953918
0 references
0.8708733916282654
0 references
0.860761821269989
0 references
0.8604205250740051
0 references
