On Hermitian Adjacency Matrices for Mixed Graphs

arXiv2205.15584MaRDI QIDQ6400639FDOQ6400639

Authors: Tao She, Chunxiang Wang 

Publication date: 31 May 2022

Abstract: We study the spectra of mixed graphs about its Hermitian adjacency matrix of the second kind (i.e. N-matrix) introduced by Mohar [1]. We extend some results and define one new Hermitian adjacency matrix, and the entry corresponding to an arc from $u$ to $v$ is equal to the $k$-th( or the third) root of unity, i.e. $omega=cos(2pi/k)+extbfisin(2pi/k),kgeq3$; the entry corresponding to an undirected edge is equal to 1, and 0 otherwise. In this paper, we characterize the cospectrality conditions for a mixed graph and its underlying graph. In section 4, we determine a sharp upper bound on the spectral radius of mixed graphs, and provide the corresponding extremal graphs.

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

This page was built for publication: On Hermitian Adjacency Matrices for Mixed Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6400639)