On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees
From MaRDI portal
Publication:2692183
DOI10.37236/11280OpenAlexW4323669684MaRDI QIDQ2692183
Publication date: 21 March 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.37236/11280
Cites Work
- Extremal results on average subtree density of series-reduced trees
- Indistinguishable trees and graphs
- Separating subgraphs in k-trees: Cables and caterpillars
- Monotonicity of the mean order of subtrees
- The average order of a subtree of a tree
- Exact solution of some Turán-type problems
- A characterization of \(k\)-trees
- On subtrees of trees
- On the average number of nodes in a subtree of a tree
- The average size of a connected vertex set of a \(k\)-connected graph
- On the maximum mean subtree order of trees
- The path minimises the average size of a connected induced subgraph
- Maximum number of subtrees in cacti and block graphs
- Subclasses of \(k\)-trees: characterization and recognition
- A lower bound on the average size of a connected vertex set of a graph
- On the Local and Global Means of Subtree Orders
- The mean order of sub‐k‐trees of k‐trees
- On the Mean Connected Induced Subgraph Order of Cographs
- Subtrees of graphs
- On the Mean Order of Connected Induced Subgraphs of Block Graphs
- Maximizing the mean subtree order
- The number of labeled k-dimensional trees
- 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
- Random subtrees and unimodal sequences in graphs
- The number and average size of connected sets in graphs with degree constraints
This page was built for publication: On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees
