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 QIDQ6540641FDOQ6540641
Publication date: 17 May 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On subtrees of trees
- Largest Number of Subtrees of Trees with a Given Maximum Degree
- Enumeration of subtrees of trees
- Algorithmic Aspects of Vertex Elimination on Graphs
- Binary trees with the largest number of subtrees
- The number of spanning trees in Apollonian networks
- The number of labeled k-dimensional trees
- Drawing planar 3-trees with given face areas
- On the average number of nodes in a subtree of a tree
- Monotonicity of the mean order of subtrees
- The average order of a subtree of a tree
- Wiener indices of maximal \(k\)-degenerate graphs
- The Complexity of the Residual Node Connectedness Reliability Problem
- Correlation of Graph‐Theoretical Indices
- On the number of connected sets in bounded degree graphs
- A lower bound on the average size of a connected vertex set of a graph
- An upper bound on Wiener indices of maximal planar graphs
- On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees
- On the Local and Global Means of Subtree Orders
- On the mean subtree order of trees under edge contraction
- The number and average size of connected sets in graphs with degree constraints
- The average size of a connected vertex set of a graph—Explicit formulas and open problems
- Enumeration of subtrees of planar two-tree networks
- The number of subtrees in graphs with given number of cut edges
This page was built for publication: Computing the number and average size of connected sets in planar 3-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6540641)
