On the average number of nodes in a subtree of a tree
From MaRDI portal
Publication:1838491
DOI10.1016/0095-8956(83)90049-7zbMath0509.05034OpenAlexW2068030953MaRDI QIDQ1838491
Publication date: 1983
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(83)90049-7
Related Items (45)
Maximising the number of connected induced subgraphs of unicyclic graphs ⋮ Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs ⋮ Alternating Whitney sums and matchings in trees. 1 ⋮ On the Local and Global Means of Subtree Orders ⋮ On different ``middle parts of a tree ⋮ On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees ⋮ The average size of matchings in graphs ⋮ A lower bound on the average size of a connected vertex set of a graph ⋮ The average size of independent sets of graphs ⋮ Greedy trees, subtrees and antichains ⋮ On the mean subtree order of trees under edge contraction ⋮ On the mean subtree order of graphs under edge addition ⋮ The average size of a connected vertex set of a graph—Explicit formulas and open problems ⋮ On the probability that a random subtree is spanning ⋮ Extremal results on average subtree density of series-reduced trees ⋮ Random subtrees and unimodal sequences in graphs ⋮ The number and average size of connected sets in graphs with degree constraints ⋮ Solution to a conjecture on the mean subtree order of graphs under edge addition ⋮ The ratio of the numbers of odd and even cycles in outerplanar graphs ⋮ Decreasing the mean subtree order by adding k edges ⋮ The expected subtree number index in random polyphenylene and spiro chains ⋮ On the roots of the subtree polynomial ⋮ On the Number of Nonisomorphic Subtrees of a Tree ⋮ Central Limit Theorems for Additive Tree Parameters with Small Toll Functions ⋮ On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees ⋮ Graphs with only caterpillars as spanning trees ⋮ The average order of dominating sets of a graph ⋮ Indistinguishable trees and graphs ⋮ Subtrees of spiro and polyphenyl hexagonal chains ⋮ Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees ⋮ When bad things happen to good trees ⋮ The average order of a subtree of a tree ⋮ On Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees ⋮ On the Mean Order of Connected Induced Subgraphs of Block Graphs ⋮ An Efficient Method of Examining all Trees ⋮ Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees ⋮ On subtree number index of generalized book graphs, fan graphs, and wheel graphs ⋮ Cut and pendant vertices and the number of connected induced subgraphs of a graph ⋮ The average size of a connected vertex set of a \(k\)-connected graph ⋮ On the maximum mean subtree order of trees ⋮ On the Mean Connected Induced Subgraph Order of Cographs ⋮ On the average order of a dominating set of a forest ⋮ Monotonicity of the mean order of subtrees ⋮ On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees ⋮ The path minimises the average size of a connected induced subgraph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Meet-distributive lattices and the anti-exchange closure
- The distribution of degrees in a large random tree
- Cycles in the complement of a tree
- Mean distance in a graph
- Listing and Counting Subtrees of a Tree
- On the Order of Random Channel Networks
- On the Altitude of Nodes in Random Trees
- On the height of trees
- The distance between points in random trees
This page was built for publication: On the average number of nodes in a subtree of a tree
