Subtrees of graphs
From MaRDI portal
Publication:4646947
Recommendations
Cited in
(26)- The number and average size of connected sets in graphs with degree constraints
- Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees
- Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
- The path minimises the average size of a connected induced subgraph
- Decreasing the mean subtree order by adding k edges
- Subgroup-chain graphs
- The mean order of sub-\(k\)-trees of \(k\)-trees
- On the probability that a random subtree is spanning
- scientific article; zbMATH DE number 4145922 (Why is no real title available?)
- On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees
- Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices
- Solution to a conjecture on the mean subtree order of graphs under edge addition
- Random subtrees and unimodal sequences in graphs
- On subtree number index of generalized book graphs, fan graphs, and wheel graphs
- The expected subtree number index in random polyphenylene and spiro chains
- On the mean order of connected induced subgraphs of block graphs
- Fully leafed induced subtrees
- The average size of ordered binary subgraphs
- Enumeration of subtrees of planar two-tree networks
- Models of random subtrees of a graph
- The sparse sequences of graphs
- A tight upper bound on the average order of dominating sets of a graph
- Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs
- On the mean subtree order of graphs under edge addition
- On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees
- Computing the number and average size of connected sets in planar 3-trees
This page was built for publication: Subtrees of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4646947)