Edge-distance-regular graphs

Edge-distance-regularity is a concept recently introduced by the authors which is similar to that of distance-regularity, but now the graph is seen from each of its edges instead of from its vertices. More precisely, a graph @C with adjacency matrix A is edge-distance-regular when it is distance-regular around each of its edges and with the same intersection numbers for any edge taken as a root. In this paper we study this concept, give some of its properties, such as the regularity of @C, and derive some characterizations. In particular, it is shown that a graph is edge-distance-regular if and only if its k-incidence matrix is a polynomial of degree k in A multiplied by the (standard) incidence matrix. Also, the analogue of the spectral excess theorem for distance-regular graphs is proved, so giving a quasi-spectral characterization of edge-distance-regularity. Finally, it is shown that every nonbipartite graph which is both distance-regular and edge-distance-regular is a generalized odd graph.

[1]  Miguel Angel Fiol,et al.  A simple proof of the spectral excess theorem for distance-regular graphs , 2010 .

[2]  Miguel Angel Fiol,et al.  Algebraic characterizations of distance-regular graphs , 2002, Discret. Math..

[3]  Willem H. Haemers,et al.  An odd characterization of the generalized odd graphs , 2011, J. Comb. Theory, Ser. B.

[4]  Miguel Angel Fiol,et al.  On almost distance-regular graphs , 2011, J. Comb. Theory, Ser. A.

[5]  N. Biggs.  Algebraic Graph Theory , 1974 .

[6]  Miguel Angel Fiol,et al.  On the algebraic theory of pseudo-distance-regularity around a set☆ , 1999 .

[7]  Chris D. Godsil,et al.  ALGEBRAIC COMBINATORICS , 2013 .

[8]  A. Hora,et al.  Distance-Regular Graphs , 2007 .

[9]  Miguel Angel Fiol,et al.  An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs , 2001, SIAM J. Discret. Math..

[10]  G. Szegő.  Zeros of orthogonal polynomials , 1939 .

[11]  E. Garriga,et al.  Boundary graphs: The limit case of a spectral property , 1998, Discret. Math..

[12]  Martin Grötschel,et al.  Handbook of combinatorics (vol. 1) , 1996 .

[13]  José Fàbrega Canudas,et al.  Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes , 2000 .

[14]  B. McKay,et al.  Feasibility conditions for the existence of walk-regular graphs , 1980 .

[15]  E. V. Dam,et al.  On perturbations of almost distance-regular graphs , 2011, 1202.3313.

[16]  Chris D. Godsil,et al.  Distance-regularised graphs are distance-regular or distance-biregular , 1987, J. Comb. Theory, Ser. B.

[17]  W. Haemers,et al.  Association schemes , 1996 .

[18]  Miguel Angel Fiol,et al.  From Local Adjacency Polynomials to Locally Pseudo-Distance-Regular Graphs , 1997, J. Comb. Theory, Ser. B.

[19]  Willem H. Haemers,et al.  Developments on Spectral Characterizations of Graphs , 2007, Discret. Math..

[20]  Miguel Angel Fiol,et al.  On k-Walk-Regular Graphs , 2009, Electron. J. Comb..

[21]  Edwin R. van Dam,et al.  The Spectral Excess Theorem for Distance-Regular Graphs: A Global (Over)view , 2008, Electron. J. Comb..

[22]  Miguel Angel Fiol,et al.  Locally Pseudo-Distance-Regular Graphs , 1996, J. Comb. Theory, Ser. B.