Hermitian adjacency matrices of mixed multigraphs

Abstract

A mixed multigraph is obtained from an undirected multigraph by orienting a subset of its edges. In this paper, we study a new Hermitian matrix representation of mixed multigraphs, give an introduction to cospectral operations on mixed multigraphs, and characterize switching equivalent mixed multigraphs in terms of fundamental cycle basis. As an application, an upper bound of cospectral classes of mixed multigraphs with the same underlying graph is obtained.

Mixed multigraph; Hermitian adjacency matrix; Switching equivalence; Cospectral class