GRAPHS WITH NOT TOO MANY SPANNING-TREES

被引：5

作者：

DING, GL

机构：

[1] Department of Mathematics, Louisiana State University, Baton Rouge, Louisiana

来源：

NETWORKS | 1995年 / 25卷 / 04期

关键词：

D O I：

10.1002/net.3230250405

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Let G be a class of graphs that is closed under taking topological miners. We derive in this paper some necessary and sufficient conditions for the existence of a polynomial p(n) such that t(G) less than or equal to p(\E(G)\) for all graphs G in G, where t(G) is the number of spanning trees of G. (C) 1995 John Wiley and Sons, Inc.

引用

页码：193 / 197

页数：5