The following pages link to Subtrees of graphs (Q4646947):
Displaying 19 items.
- On subtree number index of generalized book graphs, fan graphs, and wheel graphs (Q2035665) (← links)
- The path minimises the average size of a connected induced subgraph (Q2113349) (← links)
- Enumeration of subtrees of planar two-tree networks (Q2168574) (← links)
- On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees (Q2169441) (← links)
- The expected subtree number index in random polyphenylene and spiro chains (Q2197461) (← links)
- Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees (Q2235776) (← links)
- Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees (Q2279409) (← links)
- On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees (Q2692183) (← links)
- On the Mean Order of Connected Induced Subgraphs of Block Graphs (Q5109058) (← links)
- On the mean subtree order of graphs under edge addition (Q6055400) (← links)
- On the probability that a random subtree is spanning (Q6056779) (← links)
- Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices (Q6064850) (← links)
- Random subtrees and unimodal sequences in graphs (Q6080114) (← links)
- The number and average size of connected sets in graphs with degree constraints (Q6081554) (← links)
- Solution to a conjecture on the mean subtree order of graphs under edge addition (Q6081580) (← links)
- Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs (Q6089577) (← links)
- Decreasing the mean subtree order by adding <i>k</i> edges (Q6144910) (← links)
- Models of random subtrees of a graph (Q6183888) (← links)
- A tight upper bound on the average order of dominating sets of a graph (Q6642500) (← links)
