Hermitian adjacency matrix of the second kind for mixed graphs

Abstract

This contribution gives an extensive study on spectra of mixed graphs via its Hermitian adjacency matrix of the second kind introduced by Mohar [21]. This matrix is indexed by the vertices of the mixed graph, and the entry corresponding to an arc from u to v is equal to the sixth root of unity ω = 1+i √ 3 2 (and its symmetric entry is ω = 1−i √ 32 ); the entry corresponding to an undirected edge is equal to 1, and 0 otherwise. The main results of this paper include the following: Some interesting properties are discovered about the characteristic polynomial of this novel matrix. Cospectral problems among mixed graphs, including mixed graphs and their underlying graphs, are studied. We give equivalent conditions for a mixed graph that shares the same spectrum of its Hermitian adjacency matrix of the second kind (H S -spectrum for short) with its underlying graph. A sharp upper bound on the H Sspectral radius is established and the corresponding extremal mixed graphs are identified. Operations which are called three-way switchings are discussed-they give rise to a large number of H S -cospectral mixed graphs. We extract all the mixed graphs whose rank of its Hermitian adjacency matrix of the second kind (H S -rank for short) is 2 (resp. 3). Furthermore, we show that all connected mixed graphs with H S -rank 2 can be determined by their H S -spectrum. However, this does not hold for all connected mixed graphs with H S -rank 3. We identify all mixed graphs whose eigenvalues of its Hermitian adjacency matrix of the second kind (H S -eigenvalues for short) lie in the range (−α, α) for α ∈ √ 2, √ 3, 2 .

Mixed graphs with cut vertices having exactly two positive eigenvalues

“…Clearly, the Hermitian adjacency matrix of a mixed graph is a natural generalization of the adjacency matrix of a simple graph. Therefore the mixed graph attracts more and more researchers' attention; see [13,21,24,25,28,35,36,52,51,50,59,60].…”