More on minors of Hermitian (quasi-)Laplacian matrix of the second kind for mixed graphs
Abstract
A mixed graph MG 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 MG. In this paper, we introduce two classes of incidence matrices of the second kind of MG, 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 MG. 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.