arXiv Analytics

Sign in

arXiv:2205.05375 [math.CO]AbstractReferencesReviewsResources

Incidence matrices and line graphs of mixed graphs

Mohammad Abudayah, Omar Alomari, Torsten Sander

Published 2022-05-11Version 1

In the theory of line graphs of undirected graphs there exists an important theorem linking the incidence matrix of the root graph to the adjacency matrix of its line graph. For directed or mixed graphs, however, the exists no analogous result. The goal of this article is to present aligned definitions of the adjacency matrix, the incidence matrix and line graph of a mixed graph such that the mentioned theorem is valid for mixed graphs.

Related articles: Most relevant | Search more
arXiv:1209.3190 [math.CO] (Published 2012-09-14)
New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
arXiv:1108.4810 [math.CO] (Published 2011-08-24, updated 2012-05-26)
Nonpositive Eigenvalues of the Adjacency Matrix and Lower Bounds for Laplacian Eigenvalues
arXiv:math/0201211 [math.CO] (Published 2002-01-22)
The kernel of the adjacency matrix of a rectangular mesh