Computing the number and average size of connected sets in planar 3-trees
From MaRDI portal
Publication:6540641
DOI10.1007/s00373-024-02783-8zbMATH Open1539.05059MaRDI QIDQ6540641
Publication date: 17 May 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Trees (05C05) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Monotonicity of the mean order of subtrees
- Enumeration of subtrees of trees
- Binary trees with the largest number of subtrees
- The average order of a subtree of a tree
- On the number of connected sets in bounded degree graphs
- An upper bound on Wiener indices of maximal planar graphs
- On subtrees of trees
- On the average number of nodes in a subtree of a tree
- Drawing planar 3-trees with given face areas
- Enumeration of subtrees of planar two-tree networks
- On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees
- The number of subtrees in graphs with given number of cut edges
- The number of spanning trees in Apollonian networks
- Wiener indices of maximal \(k\)-degenerate graphs
- A lower bound on the average size of a connected vertex set of a graph
- The Complexity of the Residual Node Connectedness Reliability Problem
- Largest Number of Subtrees of Trees with a Given Maximum Degree
- On the Local and Global Means of Subtree Orders
- Algorithmic Aspects of Vertex Elimination on Graphs
- Correlation of Graph‐Theoretical Indices
- The number of labeled k-dimensional trees
- On the mean subtree order of trees under edge contraction
- The average size of a connected vertex set of a graph—Explicit formulas and open problems
- The number and average size of connected sets in graphs with degree constraints
This page was built for publication: Computing the number and average size of connected sets in planar 3-trees
