In this article, we establish a formula for the number of spanning trees in the lexicographic product of two graphs, in which one graph is an arbitrary graph G and the other is a complete multipartite graph. The results extend some of the previous work, which is closely related to the ...
Sharp upper and lower bounds on the number of spanning trees in Cartesian product of graphs AFLP技术在笛鲷的仔鱼鉴定及其分类学上的研究 Cartesian Bicategories II RAPD对红鳍笛鲷(♀)×千年笛鲷(♂)子一代杂种优势预测的分析 探析贾湖骨笛承载的社会信息 The Maximality of Cartesian Categories 紫红笛鲷线...
The algorithm of John and Sachs (1990), based on the theorem of Gutman, Mallion and Essam (1983), is applied to give an independent count of the number of spanning trees in the recently synthesised sixty-carbon-atom cluster Buckminsterfullerene (icosahedral C 60 , footballene, soccerballene,...
In this paper we give an exact analytical expression for the number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs. This number is an important graph invariant related to different topological and dynamic properties of the graph, such as its reliabilit...
The number of spanning trees of a graph G is the total number of distinct spanning subgraphs of G that are trees. In this paper, we present sharp upper bounds for the number of spanning trees of a graph with given matching number.Keywords: graph, matrix, Laplacian spectrum, spanning tree,...
Levine gave a formula that relates the number of rooted spanning trees of LG and that of G, with the restriction that G has no sources. In this note, we show that this restriction can be removed, thus his formula holds for all digraphs....
A new proof that the number of spanning trees of K m,n is m n−1 n m−1 is presented. The proof is similar to Prüfer’s proof of...
The number of spanning trees in circulant graphs Mordecai J. Golin,Xuerong Yong,Yuanping Zhang - 《Discrete Mathematics》 - 2010 - 被引量: 93 The number of spanning trees of a graph with given matching number. F...
The number of spanning trees of composite graphs. 来自 国家科技图书文献中心 喜欢 0 阅读量: 13 作者: J Li,WC Shiu 摘要: Summary: Some formulae for computing the numbers of spanning trees of the corona and the join of graphs are deduced. 关键词: Spanning trees Laplacian spectrum Matrix-...
Due to the application in reliable information transmission, parallel transmission and safe distribution of information, and parallel diagnosis algorithm for faulty servers, completely independent spanning trees (CISTs) play important roles in the interc