Maximum number of subtrees in cacti and block graphs

DOI10.1007/S00010-022-00879-1MaRDI QIDQ2172841zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

cactus graphblock graphnumber of subtrees

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3425889 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• A survey on graphs extremal with respect to distance-based topological indices
• A unified approach to extremal cacti for different indices
• Binary trees with the largest number of subtrees
• Comparison of Wiener index and Zagreb eccentricity indices
• Enumeration of subtrees of trees
• Extremal problems for trees with given segment sequence
• Extremal results for cacti
• Further analysis on the total number of subtrees of trees
• Graph theory with applications
• Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs
• Greedy trees, caterpillars, and Wiener-type graph invariants
• Greedy trees, subtrees and antichains
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• On The Product of Two Power Series
• On subtrees of trees
• On the Wiener index of the forest induced by contraction of edges in a tree
• On the log-convexity of combinatorial sequences
• On the maximum mean subtree order of trees
• Relations between Merrifield-Simmons and Wiener indices
• Subtrees and independent subsets in unicyclic graphs and unicyclic graphs with fixed segment sequence
• The general position number of Cartesian products involving a factor with small diameter
• The number of subtrees in graphs with given number of cut edges
• The number of subtrees of trees with given degree sequence
• Total distance, Wiener index and opportunity index in wreath products of star graphs

Cited in

(3)

• Extremal edge general position sets in some graphs
• On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees
• Subtrees and independent subsets in unicyclic graphs and unicyclic graphs with fixed segment sequence

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)