Monotonicity of the mean order of subtrees

DOI10.1016/0095-8956(84)90046-7zbMATH Open0544.05054OpenAlexW2021475178MaRDI QIDQ796552FDOQ796552

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

zbMATH Keywords

monotonicityfiltersubtreeaverage number of nodes

Mathematics Subject Classification ID

Trees (05C05) Graph theory (05C99) Ordered sets (06A99)

Cites Work

• Mean distance in a graph
• On the average number of nodes in a subtree of a tree
• Title not available (Why is that?)

Cited In (34)

• The average order of dominating sets of a graph
• On the Mean Connected Induced Subgraph Order of Cographs
• On the mean subtree order of trees under edge contraction
• The number and average size of connected sets in graphs with degree constraints
• A lower bound on the average size of a connected vertex set of a graph
• Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
• The average size of independent sets of graphs
• Decreasing the mean subtree order by adding k edges
• The average order of a subtree of a tree
• Maximising the number of connected induced subgraphs of unicyclic graphs
• On the probability that a random subtree is spanning
• The average size of a connected vertex set of a \(k\)-connected graph
• The average size of a connected vertex set of a graph—Explicit formulas and open problems
• On the maximum mean subtree order of trees
• Greedy trees, subtrees and antichains
• On the maximum local mean order of sub-\(k\)-trees of a \(k\)-tree
• On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees
• The ratio of the numbers of odd and even cycles in outerplanar graphs
• Solution to a conjecture on the mean subtree order of graphs under edge addition
• Random subtrees and unimodal sequences in graphs
• On the difference of mean subtree orders under edge contraction
• 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
• A tight upper bound on the average order of dominating sets of a graph
• On the Local and Global Means of Subtree Orders
• Alternating Whitney sums and matchings in trees. 1
• Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs
• On the mean subtree order of graphs under edge addition
• When bad things happen to good trees
• On the Number of Nonisomorphic Subtrees of a Tree
• On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees
• On the roots of the subtree polynomial
• Computing the number and average size of connected sets in planar 3-trees
• The average size of matchings in graphs

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

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