Computing the number and average size of connected sets in planar 3-trees

DOI10.1007/S00373-024-02783-8MaRDI QIDQ6540641zbMATH OpenFDO

Authors Zuwen Luo, Kexiang Xu

Publication date 17 May 2024

Published in Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

enumerationconnected setsplanar 3-tree

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)

Recommendations

• Subset counting in trees
• Enumeration of subtrees of planar two-tree networks
• The average size of a connected vertex set of a graph—Explicit formulas and open problems
• Subtrees of graphs
• A lower bound on the average size of a connected vertex set of a graph

Cites work

• scientific article; zbMATH DE number 6813595 (Why is no real title available?)
• A lower bound on the average size of a connected vertex set of a graph
• Algorithmic Aspects of Vertex Elimination on Graphs
• An upper bound on Wiener indices of maximal planar graphs
• Binary trees with the largest number of subtrees
• Correlation of Graph‐Theoretical Indices
• Drawing planar 3-trees with given face areas
• Enumeration of subtrees of planar two-tree networks
• Enumeration of subtrees of trees
• Graph theory
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• Monotonicity of the mean order of subtrees
• On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees
• On subtrees of trees
• On the average number of nodes in a subtree of a tree
• On the local and global means of subtree orders
• On the mean subtree order of trees under edge contraction
• On the number of connected sets in bounded degree graphs
• The Complexity of the Residual Node Connectedness Reliability Problem
• The average order of a subtree of a tree
• 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
• The number of labeled k-dimensional trees
• The number of spanning trees in Apollonian networks
• The number of subtrees in graphs with given number of cut edges
• Wiener indices of maximal \(k\)-degenerate graphs

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)