Monotonicity of the mean order of subtrees

From MaRDI portal
Publication:796552

DOI10.1016/0095-8956(84)90046-7zbMath0544.05054OpenAlexW2021475178MaRDI QIDQ796552

Robert E. Jamison

Publication date: 1984

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(84)90046-7




Related Items (29)

Maximising the number of connected induced subgraphs of unicyclic graphsNordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphsAlternating Whitney sums and matchings in trees. 1On the Local and Global Means of Subtree OrdersOn computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of treesThe average size of matchings in graphsA lower bound on the average size of a connected vertex set of a graphThe average size of independent sets of graphsGreedy trees, subtrees and antichainsOn the mean subtree order of trees under edge contractionOn the mean subtree order of graphs under edge additionThe average size of a connected vertex set of a graph—Explicit formulas and open problemsOn the probability that a random subtree is spanningRandom subtrees and unimodal sequences in graphsThe number and average size of connected sets in graphs with degree constraintsSolution to a conjecture on the mean subtree order of graphs under edge additionThe ratio of the numbers of odd and even cycles in outerplanar graphsDecreasing the mean subtree order by adding k edgesOn the roots of the subtree polynomialOn the Number of Nonisomorphic Subtrees of a TreeOn the local and global mean orders of sub-\(k\)-trees of \(k\)-treesThe average order of dominating sets of a graphEnumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in treesWhen bad things happen to good treesOn subtree number index of generalized book graphs, fan graphs, and wheel graphsCut and pendant vertices and the number of connected induced subgraphs of a graphThe average size of a connected vertex set of a \(k\)-connected graphOn the maximum mean subtree order of treesOn the Mean Connected Induced Subgraph Order of Cographs



Cites Work


This page was built for publication: Monotonicity of the mean order of subtrees