Abstract
A mixed graph is a graph whose edge set consists of both oriented and unoriented edges. The Hermitian-adjacency matrix of an [Formula: see text]-vertex mixed graph is a square matrix [Formula: see text] of order [Formula: see text], where [Formula: see text] if there is an arc from [Formula: see text] to [Formula: see text] and [Formula: see text] if there is an edge between [Formula: see text] and [Formula: see text], and [Formula: see text] otherwise. Let [Formula: see text] be a diagonal matrix, where [Formula: see text] is the degree of [Formula: see text] in the underlying graph of [Formula: see text]. The matrices [Formula: see text] and [Formula: see text] are, respectively, the Hermitian Laplacian and Hermitian quasi-Laplacian matrix of the mixed graph [Formula: see text]. In this paper, we first found coefficients of the characteristic polynomial of Hermitian Laplacian and Hermitian quasi-Laplacian matrices of the mixed graph [Formula: see text]. Second, we discussed relationship between the spectra of Hermitian Laplacian and Hermitian quasi-Laplacian matrices of the mixed graph [Formula: see text].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
