Hermitian Adjacency Matrices of Mixed Graphs
From MaRDI portal
Abstract: The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be not real. To overcome this obstacle, several authors have recently defined and studied various Hermitian adjacency matrices of digraphs or mixed graphs. In this work we unify previous work and offer a new perspective on the subject by introducing the concept of monographs. Moreover, we consider questions of cospectrality.
This page was built for publication: Hermitian Adjacency Matrices of Mixed Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6364215)
