A Counting Formula for Spanning Trees of Kn-complemented Graphs of Semiregular Bipartite Graph
Let G be a semiregular bipartite subgraph of the complete graph Kn,and the Kn-complemented graph of G be the graph obtained by deleting all edges of the subgraph G from Kn.This research obtains the general counting determinant formula of the spanning tree of Kn-complemented graphs of semiregular bipartite graph based on the Kirchhoff matrix-tree theorem,the Schur complement of matrices,and the theory of electrical network equiv-alence.
NETL
NSTL
万方数据
