Weakly distance-regular digraphs

We introduce the concept of weakly distance-regular digraph and study some of its basic properties. In particular, the (standard) distance-regular digraphs, introduced by Damerell, turn out to be those weakly distance-regular digraphs which have a normal adjacency matrix. As happens in the case of distance-regular graphs, the study is greatly facilitated by a family of orthogonal polynomials called the distance polynomials. For instance, these polynomials are used to derive the spectrum of a weakly distance-regular digraph. Some examples of these, digraphs, such as the butterfly and the cycle prefix digraph which are interesting for their applications, are analyzed in the light of the developed theory. Also, some new constructions involving the line digraph and other techniques are presented.

[1]  R. M. Damerell.  Distance-transitive and distance-regular digraphs , 1981, J. Comb. Theory, Ser. B.

[2]  Hikoe Enomoto,et al.  Distance-regular digraphs of girth 4 , 1987, J. Comb. Theory, Ser. B.

[3]  F. R. Gantmakher.  The Theory of Matrices , 1984 .

[4]  Margarida Mitjana,et al.  The Spectra of Cycle Prefix Digraphs , 2003, SIAM J. Discret. Math..

[5]  E. Bannai,et al.  Algebraic Combinatorics I: Association Schemes , 1984 .

[6]  W. Greub.  Linear Algebra , 1981 .

[7]  Stéphane Pérennes,et al.  Hamilton Circuits in the Directed Wrapped Butterfly Network , 1998, Discret. Appl. Math..

[8]  Douglas A. Leonard,et al.  The Girth of a Directed Distance-Regular Graph , 1993, J. Comb. Theory, Ser. B.

[9]  Art M. Duval.  A directed graph version of strongly regular graphs , 1988, J. Comb. Theory, Ser. A.

[10]  Miguel Angel Fiol,et al.  Line Digraph Iterations and the (d, k) Digraph Problem , 1984, IEEE Transactions on Computers.

[11]  Margarida Mitjana.  Propagació d'informació en grafs i digrafs que modelen xarxes d'interconnexió simètriques , 1999 .

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

[13]  Jeff Kahn,et al.  Nonexistence of certain distance-transitive digraphs , 1981, J. Comb. Theory, Ser. B.

[14]  Oriol Serra,et al.  Cayley Digraphs Based on the de Bruijn Networks , 1998, SIAM J. Discret. Math..

[15]  Tomihiko Takahashi.  DISTANCE-REGULAR DIGRAPHS OF GIRTH 6 , 1991 .

[16]  William Y. C. Chen,et al.  Cycle prefix digraphs for symmetric interconnection networks , 1993, Networks.

[17]  Robert A. Liebler,et al.  Certain distance-regular digraphs and related rings of characteristic 4 , 1988, J. Comb. Theory, Ser. A.

[18]  Hiroshi Suzuki,et al.  Weakly Distance-regular Digraphs , 2003, Discret. Math..

[19]  Clement W. H. Lam,et al.  Distance transitive digraphs , 1980, Discret. Math..

[20]  Miguel Angel Fiol,et al.  Vertex-symmetric digraphs with small diameter , 1995 .

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

[22]  Ralf Klasing,et al.  Compressing cube‐connected cycles and butterfly networks , 1998 .