The number of subtrees in graphs with given number of cut edges

DOI10.1016/J.DAM.2021.08.009MaRDI QIDQ2231772zbMATH OpenOpenAlexFDO

Authors Kexiang Xu, Jie Li, Hua Wang

Publication date 30 September 2021

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2021.08.009

zbMATH Keywords

cut edgenumber of subtreespseudo-component

Mathematics Subject Classification ID

Trees (05C05) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Enumeration in graph theory (05C30) Connectivity (05C40)

Recommendations

• On the number of subtrees for almost all graphs
• On the number of induced subgraphs of trees
• On the number of certain subgraphs contained in graphs with a given number of edges
• The number of subtrees of trees with given degree sequence
• On the number of cut-vertices in a graph
• The number of subtrees of trees with given diameter
• The tree of cuts and minimal \(k\)-connected graphs
• The enumeration of labeled graphs by number of cutpoints
• Edge-cut cycles and cutting numbers of cycles and graphs

Cites work

• A survey on graphs extremal with respect to distance-based topological indices
• Binary trees with the largest number of subtrees
• Correlation of Graph‐Theoretical Indices
• Cut and pendant vertices and the number of connected induced subgraphs of a graph
• Extremal problems for trees with given segment sequence
• Extremal values of ratios: distance problems vs. subtree problems in trees
• Extremal values of ratios: distance problems vs. subtree problems in trees. II
• 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
• Maximum Wiener index of trees with given degree sequence
• Metric properties of generalized Sierpiński graphs over stars
• On subtrees of trees
• On the Wiener index of graphs
• Relations between Merrifield-Simmons and Wiener indices
• Subtrees and independent subsets in unicyclic graphs and unicyclic graphs with fixed segment sequence
• The minimal number of subtrees with a given degree sequence
• The number of subtrees of trees with given degree sequence
• Total distance, Wiener index and opportunity index in wreath products of star graphs
• Wiener and Schultz molecular topological indices of graphs with specified cut edges

Cited in

(15)

• A sharp upper bound for the number of stable sets in graphs with given number of cut edges
• Cut and pendant vertices and the number of connected induced subgraphs of a graph
• Enumeration of subtrees of planar two-tree networks
• Maximum number of subtrees in cacti and block graphs
• On the number of subtrees for almost all graphs
• Subtrees of graphs
• Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices
• Extremal problems for connected set enumeration
• Computing the number and average size of connected sets in planar 3-trees
• The subpath number of cactus graphs
• Exact counting of subtrees with diameter no more than d in trees: a generating function approach
• Invitation to the subpath number
• Subtree number versus Wiener index
• A sharp upper bound for the number of connected sets in any grid graph
• Counting geodesic paths in graphs

This page was built for publication: The number of subtrees in graphs with given number of cut edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2231772)