Some mixed graphs with H-rank 4, 6 or 8

The H -rank of a mixed graph G α is defined to be the rank of its Hermitian adjacency matrix H ( G α ) . If G α is switching equivalent to a mixed graph ( G α ) ′ , and two vertices u , v of G α have exactly the same neighborhood in ( G α ) ′ , then u and v are said to be twins. The twin reduction graph T G α of G α is a mixed graph whose vertices are the equivalence classes, and [ u ] [ v ] ∈ E ( T G α ) if u v ∈ E ( ( G α ) ′ ) , where [ u ] denotes the equivalence class containing the vertex u . In this paper, we give the upper (resp., lower) bound of the number of vertices of the twin reduction graphs of connected mixed bipartite graphs, and characterize all twin reduction graphs of the connected mixed bipartite graphs with H -rank 4 (resp., 6 or 8). Then, we characterize all connected mixed graphs with H -rank 4 (resp., 6 or 8) among all mixed graphs containing induced mixed odd cycles whose lengths are no less than 5 (resp., 7 or 9).