Maximum number of subtrees in cacti and block graphs

被引:4
|
作者
Li, Jie [1 ,2 ]
Xu, Kexiang [1 ,2 ]
Zhang, Tianli [1 ,2 ]
Wang, Hua [3 ]
Wagner, Stephan [4 ,5 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Coll Math, Nanjing 210016, Peoples R China
[2] Comp Air Vehicles, MIIT Key Lab Math Modelling & High Performance, Nanjing 210016, Peoples R China
[3] Georgia Southern Univ, Dept Math Sci, Statesboro, GA 30460 USA
[4] Uppsala Univ, Dept Math, S-75106 Uppsala, Sweden
[5] Stellenbosch Univ, Dept Math Sci, ZA-7602 Stellenbosch, South Africa
关键词
Number of subtrees; Cactus graph; Block graph; WIENER INDEX; TREES;
D O I
10.1007/s00010-022-00879-1
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
For a graph G, we denote by N(G) the number of non-empty subtrees of G. As a topological index based on counting, N(G) has some correlations to other well studied topological indices, including the Wiener index W(G). In this paper we characterize the extremal graphs with the maximum number of subtrees among all cacti of order n with k cycles. Similarly, the extremal graphs with the maximum number of subtrees among all block graphs of order n with k blocks are also determined and shown to have the minimum Wiener index within the same collection of graphs. Analogous results are also obtained for the number of connected subgraphs C(G). Finally, a general question is posed concerning the relation between the number of subtrees and the Wiener index of graphs.
引用
收藏
页码:1027 / 1040
页数:14
相关论文
共 50 条
  • [31] Distance graphs with maximum chromatic number
    Barajas, Javier
    Serra, Oriol
    DISCRETE MATHEMATICS, 2008, 308 (08) : 1355 - 1365
  • [32] The Kernel of Maximum Agreement Subtrees
    Swenson, Krister M.
    Chen, Eric
    Pattengale, Nicholas D.
    Sankoff, David
    BIOINFORMATICS RESEARCH AND APPLICATIONS, 2011, 6674 : 123 - +
  • [33] The Kernel of Maximum Agreement Subtrees
    Swenson, Krister M.
    Chen, Eric
    Pattengale, Nicholas D.
    Sankoff, David
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2012, 9 (04) : 1023 - 1031
  • [34] Relating the total domination number and the annihilation number of cactus graphs and block graphs
    Bujtas, Csilla
    Jakovac, Marko
    ARS MATHEMATICA CONTEMPORANEA, 2019, 16 (01) : 183 - 202
  • [35] Hamiltonian chromatic number of block graphs
    Bantva D.
    Journal of Graph Algorithms and Applications, 2017, 21 (03) : 353 - 369
  • [36] THE MAXIMUM NUMBER OF DIAGONALS OF A CYCLE IN A BLOCK
    ASH, P
    DISCRETE MATHEMATICS, 1985, 55 (03) : 305 - 309
  • [37] The Minimal Number of Subtrees of a Tree
    Sills, Andrew V.
    Wang, Hua
    GRAPHS AND COMBINATORICS, 2015, 31 (01) : 255 - 264
  • [38] Cacti with with the maximum Merrifield-Simmons index and given number of cut edges
    Wang, Maolin
    APPLIED MATHEMATICS LETTERS, 2010, 23 (12) : 1416 - 1420
  • [39] On the Number of Nonisomorphic Subtrees of a Tree
    Czabarka, Eva
    Szekely, Laszlo A.
    Wagner, Stephan
    JOURNAL OF GRAPH THEORY, 2018, 87 (01) : 89 - 95
  • [40] MAXIMUM NUMBER OF EDGES IN CONNECTED GRAPHS WITH A GIVEN DOMINATION NUMBER
    SANCHIS, LA
    DISCRETE MATHEMATICS, 1991, 87 (01) : 65 - 72