On the structure of the adjacency matrix of the line digraph of a regular digraph
Simone Severini
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.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.