Maximum number of subtrees in cacti and block graphs
DOI10.1007/S00010-022-00879-1zbMATH Open1497.05125OpenAlexW4224273492MaRDI QIDQ2172841FDOQ2172841
Authors: Jie Li, Kexiang Xu, Tianli Zhang, Hua Wang, Stephan 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
Recommendations
- Maximum max-k-clique subgraphs in cactus subtree graphs
- Largest Number of Subtrees of Trees with a Given Maximum Degree
- On the number of subtrees for almost all graphs
- scientific article; zbMATH DE number 644325
- The domatic number of block-cactus graphs
- The number of subtrees in graphs with given number of cut edges
- scientific article; zbMATH DE number 932184
- Maximal trees with bounded maximum degree in a graph
- Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
Trees (05C05) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Extremal problems in graph theory (05C35) Combinatorial aspects of block designs (05B05) Distance in graphs (05C12) Enumeration in graph theory (05C30) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Cites Work
- Title not available (Why is that?)
- On subtrees of trees
- A survey on graphs extremal with respect to distance-based topological indices
- Graph theory with applications
- Largest Number of Subtrees of Trees with a Given Maximum Degree
- Title not available (Why is that?)
- Enumeration of subtrees of trees
- Greedy trees, caterpillars, and Wiener-type graph invariants
- Greedy trees, subtrees and antichains
- The number of subtrees of trees with given degree sequence
- Binary trees with the largest number of subtrees
- On the log-convexity of combinatorial sequences
- Further analysis on the total number of subtrees of trees
- On The Product of Two Power Series
- Extremal problems for trees with given segment sequence
- A unified approach to extremal cacti for different indices
- 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
- Subtrees and independent subsets in unicyclic graphs and unicyclic graphs with fixed segment sequence
- Comparison of Wiener index and Zagreb eccentricity indices
- On the maximum mean subtree order of trees
- Extremal results for cacti
- The general position number of Cartesian products involving a factor with small diameter
- Relations between Merrifield-Simmons and Wiener indices
- The number of subtrees in graphs with given number of cut edges
- On the Wiener index of the forest induced by contraction of edges in a tree
Cited In (3)
This page was built for publication: Maximum number of subtrees in cacti and block graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2172841)
