Algebraic properties of a digraph and its line digraph

Let G be a digraph, LG its line digraph and A(G) and A(LG) their adjacency matrices. We present relations between the Jordan Normal Form of these two matrices. In addition, we study the spectra of those matrices and obtain a relationship between their characteristic polynomials that allows us to relate properties of G and LG, specifically the number of cycles of a given length.

[1]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[2]  H.B. Walikar,et al.  On the Eigenvalues of a Graph , 2003, Electron. Notes Discret. Math..

[3]  Fuji Zhang,et al.  When a digraph and its line digraph are connected and cospectral , 1998, Discret. Math..

[4]  Charles R. Johnson,et al.  The Relationship between AB and BA , 1996 .

[5]  A. Abian,et al.  Jordan canonical forms of matrices AB and BA , 1988 .

[6]  L. Beineke,et al.  Selected Topics in Graph Theory 2 , 1985 .

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

[8]  Michael Doob,et al.  Spectra of graphs , 1980 .

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

[10]  M. Aigner.  On the linegraph of a directed graph , 1967 .

[11]  R. Z. Norman,et al.  Some properties of line digraphs , 1960 .

[12]  Harley Flanders,et al.  Elementary divisors of $AB$ and $BA$ , 1951 .