Maximum number of subtrees in cacti and block graphs
DOI10.1007/s00010-022-00879-1zbMath1497.05125OpenAlexW4224273492MaRDI QIDQ2172841
Kexiang Xu, Tianli Zhang, Jie Li, Hua Wang, Stephan G. Wagner
Publication date: 16 September 2022
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00010-022-00879-1
Trees (05C05) Extremal problems in graph theory (05C35) Combinatorial aspects of block designs (05B05) Enumeration in graph theory (05C30) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Related Items (2)
Cites Work
- Greedy trees, subtrees and antichains
- Extremal problems for trees with given segment sequence
- Total distance, Wiener index and opportunity index in wreath products of star graphs
- Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs
- Enumeration of subtrees of trees
- Binary trees with the largest number of subtrees
- On subtrees of trees
- Further analysis on the total number of subtrees of trees
- Extremal results for cacti
- On the maximum mean subtree order of trees
- The number of subtrees in graphs with given number of cut edges
- The general position number of Cartesian products involving a factor with small diameter
- On the log-convexity of combinatorial sequences
- Largest Number of Subtrees of Trees with a Given Maximum Degree
- Subtrees and independent subsets in unicyclic graphs and unicyclic graphs with fixed segment sequence
- Comparison of Wiener index and Zagreb eccentricity indices
- The Number of Subtrees of Trees with Given Degree Sequence
- On The Product of Two Power Series
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Maximum number of subtrees in cacti and block graphs
