The number of subtrees in graphs with given number of cut edges
From MaRDI portal
Publication:2231772
DOI10.1016/j.dam.2021.08.009zbMath1473.05138OpenAlexW3193598952MaRDI QIDQ2231772
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
Trees (05C05) Enumeration in graph theory (05C30) Connectivity (05C40) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Related Items (4)
Enumeration of subtrees of planar two-tree networks ⋮ Maximum number of subtrees in cacti and block graphs ⋮ Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices ⋮ Extremal problems for connected set enumeration
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Greedy trees, subtrees and antichains
- The minimal number of subtrees with a given degree sequence
- 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
- Binary trees with the largest number of subtrees
- On the Wiener index of graphs
- On subtrees of trees
- Further analysis on the total number of subtrees of trees
- Extremal values of ratios: distance problems vs. subtree problems in trees
- Metric properties of generalized Sierpiński graphs over stars
- Cut and pendant vertices and the number of connected induced subgraphs of a graph
- Extremal values of ratios: distance problems vs. subtree problems in trees. II
- Largest Number of Subtrees of Trees with a Given Maximum Degree
- The Maximum Wiener Index of Trees with Given Degree Sequences
- Subtrees and independent subsets in unicyclic graphs and unicyclic graphs with fixed segment sequence
- The Number of Subtrees of Trees with Given Degree Sequence
- Correlation of Graph‐Theoretical Indices
This page was built for publication: The number of subtrees in graphs with given number of cut edges