Name
Abstract | ||
|---|---|---|
A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give some (combinatorial and algebraic) proofs of the fact that every edge-distance-regular graph @C is distance-regular and homogeneous. More precisely, @C is edge-distance-regular if and only if it is bipartite distance-regular or a generalized odd graph. Also, we obtain the relationships between some of their corresponding parameters, mainly, the distance polynomials and the intersection numbers. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.jcta.2013.02.006 | J. Comb. Theory, Ser. A |
Keywords | Field | DocType |
bipartite distance-regular,corresponding parameter,generalized odd graph,intersection number,distance polynomial,edge-distance-regular graph,orthogonal polynomials | Discrete mathematics,Combinatorics,Strongly regular graph,Line graph,Vertex-transitive graph,Intersection graph,Foster graph,Regular graph,Distance-regular graph,Mathematics,Complement graph | Journal |
Volume | Issue | ISSN |
120 | 5 | 0097-3165 |
Citations | PageRank | References |
0 | 0.34 | 12 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. CáMara | 1 | 15 | 1.96 |
| Cristina Dalfó | 2 | 46 | 9.47 |
| charles delorme | 3 | 49 | 10.33 |
| M. A. Fiol | 4 | 816 | 87.28 |
| H. Suzuki | 5 | 17 | 3.26 |