Geodesic
The spectral excess theorem for distance-biregular graphs.
Miquel Àngel Fiol1
1Universitat Politècnica de Catalunya
The electronic journal of combinatorics, Tome 20 (2013) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/3305
Classification : 05E30
Mots-clés : distance-biregular graph, spectral excess theorem, orthogonal polynomials

Miquel Àngel Fiol  1

1 Universitat Politècnica de Catalunya 
@article{10_37236_3305,
     author = {Miquel \`Angel Fiol},
     title = {The spectral excess theorem for distance-biregular graphs.},
     journal = {The electronic journal of combinatorics},
     year = {2013},
     volume = {20},
     number = {3},
     doi = {10.37236/3305},
     zbl = {1295.05272},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/3305/}
}
TY  - JOUR
AU  - Miquel Àngel Fiol
TI  - The spectral excess theorem for distance-biregular graphs.
JO  - The electronic journal of combinatorics
PY  - 2013
VL  - 20
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/3305/
DO  - 10.37236/3305
ID  - 10_37236_3305
ER  - 
%0 Journal Article
%A Miquel Àngel Fiol
%T The spectral excess theorem for distance-biregular graphs.
%J The electronic journal of combinatorics
%D 2013
%V 20
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/3305/
%R 10.37236/3305
%F 10_37236_3305
Miquel Àngel Fiol. The spectral excess theorem for distance-biregular graphs.. The electronic journal of combinatorics, Tome 20 (2013) no. 3. doi: 10.37236/3305

Cité par Sources :