arXiv Analytics

Sign in

arXiv:2207.07214 [math.CO]AbstractReferencesReviewsResources

More on minors of Hermitian (quasi-)Laplacian matrix of the second kind for mixed graphs

Qi Xiong, Gui-Xian Tian, Shu-Yu Cui

Published 2022-07-14Version 1

A mixed graph $M_{G}$ is the graph obtained from an unoriented simple graph $G$ by giving directions to some edges of $G$, where $G$ is often called the underlying graph of $M_{G}$. In this paper, we introduce two classes of incidence matrices of the second kind of $M_{G}$, and discuss the determinants of these two matrices for rootless mixed trees and unicyclic mixed graphs. Applying these results, we characterize the explicit expressions of various minors for Hermitian (quasi-)Laplacian matrix of the second kind of $M_{G}$. Moreover, we give two sufficient conditions that the absolute values of all the cofactors of Hermitian (quasi-)Laplacian matrix of the second kind are equal to the number of spanning trees of the underlying graph $G$.

Comments: 16 pages,7 figures
Categories: math.CO
Subjects: 05C50, 15A18
Related articles: Most relevant | Search more
arXiv:2411.00292 [math.CO] (Published 2024-11-01)
Inverse eigenvalue problem for Laplacian matrices of a graph
arXiv:1102.2950 [math.CO] (Published 2011-02-15)
Kron Reduction of Graphs with Applications to Electrical Networks
arXiv:2009.05996 [math.CO] (Published 2020-09-13)
Trees with Matrix Weights: Laplacian Matrix and Characteristic-like Vertices