A simple upper bound for the number of spanning trees of regular graphs

被引：0
|
作者：
机构：
来源：
Discrete Math Appl | 2008年 / 4卷 / 363-366期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] A simple upper bound for the number of spanning trees of regular graphs
    Voblyi, V. A.
    DISCRETE MATHEMATICS AND APPLICATIONS, 2008, 18 (04): : 363 - 366
  • [2] Upper bound for the number of spanning forests of regular graphs
    Bencs, Ferenc
    Csikvari, Peter
    EUROPEAN JOURNAL OF COMBINATORICS, 2023, 110
  • [3] The Number of Spanning Trees in 4-Regular Simple Graphs
    Sereni, Jean-Sebastien
    Yilma, Zelealem B.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2024, 31 (04):
  • [4] On the number of spanning trees in random regular graphs
    Greenhill, Catherine
    Kwan, Matthew
    Wind, David
    ELECTRONIC JOURNAL OF COMBINATORICS, 2014, 21 (01):
  • [5] Upper bounds for the number of spanning trees of graphs
    Ş Burcu Bozkurt
    Journal of Inequalities and Applications, 2012
  • [6] Upper bounds for the number of spanning trees of graphs
    Bozkurt, S. Burcu
    JOURNAL OF INEQUALITIES AND APPLICATIONS, 2012,
  • [7] UPPER BOUND FOR NUMBER OF SPANNING TREES OF A GRAPH
    GRIMMETT, GR
    DISCRETE MATHEMATICS, 1976, 16 (04) : 323 - 324
  • [8] The Number of Spanning Trees of the Cartesian Product of Regular Graphs
    Wu, Mei-Hui
    Chung, Long-Yeu
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2014, 2014
  • [9] Heuristic maximization of the number of spanning trees in regular graphs
    Wojciechowski, Jacek
    Arabas, Jaroslaw
    Sawionek, Blazej
    JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 2006, 343 (03): : 309 - 325
  • [10] On the upper bound for the number of spanning trees of a connected graph
    Li, Rao
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2015, 95 : 257 - 269
12345