Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Keywords |
|---|---|---|
2013 | ELECTRONIC JOURNAL OF COMBINATORICS | The spectral excess theorem,Distance-biregular graph,Local spectra,Pre-distance polynomials |
Field | DocType | Volume |
Perfect graph,Discrete mathematics,Combinatorics,Robertson–Seymour theorem,Forbidden graph characterization,Bipartite graph,1-planar graph,Extremal graph theory,Mathematics,Planar graph,Strong perfect graph theorem | Journal | 20.0 |
Issue | ISSN | Citations |
3.0 | 1077-8926 | 0 |
PageRank | References | Authors |
0.34 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| fiol mora | 1 | 0 | 0.34 |
| miquel angel | 2 | 28 | 3.43 |
| M. A. Fiol | 3 | 816 | 87.28 |