拟阈值图的Kn-补图的生成树个数
The Number of Spanning Trees in Kn-complements of Quasi-threshold Graphs
摘要:
在本文中,我们研究的图类的$K_n$ -补是树和准阈值图,并推导出公式,其生成树的数量;对于$K_n$的子图$H$,$H$的$K_n$ -补是图$K_n-H$,这是从$K_n$通过删除$H$的边缘。我们的证明是基于补充生成树矩阵定理,它表示作为一个矩阵的行列式的函数,可以很容易地从图的邻接关系构造的图的生成树的数量。我们的结果推广了以前的结果,并扩大了家庭的形式$K_n-H$承认公式,其生成树的数量的图。
英文摘要:
In this paper we examine the classes of graphs whose $K_n$-complements are trees and quasi-threshold graphs and derive formulas for their number of spanning trees; for a subgraph $H$ of $K_n$, the $K_n$-complement of $H$ is the graph $K_n-H$ which is obtained from $K_n$ by removing the edges of $H$. Our proofs are based on the complement spanning-tree matrix theorem, which expresses the number of spanning trees of a graph as a function of the determinant of a matrix that can be easily constructed from the adjacency relation of the graph. Our results generalize previous results and extend the family of graphs of the form $K_n-H$ admitting formulas for the number of their spanning trees.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。