On the number of spanning trees in fullerenes

被引:0
|
作者
机构
[1] Mihalic, Z.
[2] Trinajstica, N.
来源
Mihalic, Z. | 1600年 / 02期
关键词
Carbon;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [31] Upper bounds for the number of spanning trees of graphs
    Ş Burcu Bozkurt
    Journal of Inequalities and Applications, 2012
  • [32] The asymptotic number of spanning trees in circulant graphs
    Golin, Mordecai J.
    Yong, Xuerong
    Zhang, Yuanping
    DISCRETE MATHEMATICS, 2010, 310 (04) : 792 - 803
  • [33] On the number of spanning trees in graphs with multiple edges
    Sahbani, Hajar
    El Marraki, Mohamed
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2017, 55 (1-2) : 245 - 255
  • [34] Minimal graphs with a prescribed number of spanning trees
    Stong, Richard
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2022, 82 : 182 - 196
  • [35] Express the number of spanning trees in term of degrees
    Dong, Fengming
    Ge, Jun
    Ouyang, Zhangdong
    APPLIED MATHEMATICS AND COMPUTATION, 2022, 415
  • [36] THE NUMBER OF SPANNING-TREES OF THE REGULAR NETWORKS
    YANG, CS
    WANG, JF
    LEE, JY
    BOESCH, FT
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1988, 23 (3-4) : 185 - 200
  • [38] The Maximum Number of Spanning Trees of a Graph with Given Matching Number
    Muhuo Liu
    Guangliang Zhang
    Kinkar Chandra Das
    Bulletin of the Malaysian Mathematical Sciences Society, 2021, 44 : 3725 - 3732
  • [39] On Family of Graphs with Minimum Number of Spanning Trees
    Zbigniew R. Bogdanowicz
    Graphs and Combinatorics, 2013, 29 : 1647 - 1652
  • [40] The minimum number of spanning trees in regular multigraphs
    Pekarek, Jakub
    Sereni, Jean-Sebastien
    Yilma, Zelealem B.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2022, 29 (04):