Incidence matrices and line graphs of mixed graphs
Open Access
- 1 January 2023
- journal article
- research article
- Published by Walter de Gruyter GmbH in Special Matrices
- Vol. 11 (1)
Abstract
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, there 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.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- A new kind of Hermitian matrices for digraphsLinear Algebra and its Applications, 2020
- Relation between the -rank of a mixed graph and the rank of its underlying graphDiscrete Mathematics, 2019
- The relation between the H-rank of a mixed graph and the independence number of its underlying graphLinear and Multilinear Algebra, 2018
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graphLinear and Multilinear Algebra, 2017
- Oriented gain graphs, line graphs and eigenvaluesLinear Algebra and its Applications, 2016
- Hermitian Adjacency Matrix of Digraphs and Mixed GraphsJournal of Graph Theory, 2016
- Hermitian-adjacency matrices and Hermitian energies of mixed graphsLinear Algebra and its Applications, 2015
- Spectral properties of complex unit gain graphsLinear Algebra and its Applications, 2012
- Graphs and Matrices2010
- Congruent Graphs and the Connectivity of GraphsAmerican Journal of Mathematics, 1932