On the structure of the adjacency matrix of the line digraph of a regular digraph
Combinatorics
2007-05-23 v2
Abstract
We show that the adjacency matrix M of the line digraph of a d-regular digraph D on n vertices can be written as M=AB, where the matrix A is the Kronecker product of the all-ones matrix of dimension d with the identity matrix of dimension n and the matrix B is the direct sum of the adjacency matrices of the factors in a dicycle factorization of D.
Cite
@article{arxiv.math/0309092,
title = {On the structure of the adjacency matrix of the line digraph of a regular digraph},
author = {Simone Severini},
journal= {arXiv preprint arXiv:math/0309092},
year = {2007}
}
Comments
5 pages