On the structure of the adjacency matrix of the line digraph of a regular digraph

Discrete Applied Mathematics

Volumn 154, Issue 12, 2006, Pages 1763-1765

  Severini, Simone ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Adjacency matrix; de Bruijn digraph; Line digraph

Indexed keywords

MATHEMATICAL MODELS; MATRIX ALGEBRA; NUMERICAL METHODS;

ADJACENCY MATRIX; DE BRUIJN DIGRAPH; KRONECKER PRODUCT; LINE DIGRAPH;

GRAPH THEORY;

EID: 33747055617     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.03.008     Document Type: Article

References (6)

1. Bang-Jensen J., and Gutin G. Digraphs. Theory, Algorithms and Applications, Springer Monographs in Mathematics (2001), Springer-Verlag, London
2. Ferrero D. Introduction to interconnection network models. Publ. Math. Urug. 99/25 (1999)
3. Fiol M.A., Yebra J.L.A., and Alegre I. Line digraph iterations and the ( d, k ) digraph problem. IEEE Trans. Comput. 33 (1984) 400-403
4. Hasunuma T., and Shibata Y. Isomorphic decomposition and arc-disjoint spanning trees of Kautz digraphs. IPSJ SIG Notes 96-AL-51 (1996) 63-70
5. M.-C. Heydemann, Cayley graphs and interconnection networks, Graph symmetry, Montreal, PQ, 1996, pp. 167-224, NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci. 497 (1997).
6. Kawai H., Fujikake N., and Shibata Y. Factorization of de Bruijn digraphs by cycle-rooted trees. Inform. Process. Lett. 77 5-6 (2001) 269-275