  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.
