The following pages link to Indistinguishable trees and graphs (Q489327):
Displaying 10 items.
- On the eccentric subtree number in trees (Q827611) (← links)
- On the maximum mean subtree order of trees (Q2048363) (← links)
- Independence equivalence classes of paths (Q2092372) (← links)
- On the roots of the subtree polynomial (Q2198997) (← links)
- On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees (Q2692183) (← links)
- On the mean subtree order of trees under edge contraction (Q6046687) (← links)
- On the mean subtree order of graphs under edge addition (Q6055400) (← links)
- Random subtrees and unimodal sequences in graphs (Q6080114) (← links)
- Solution to a conjecture on the mean subtree order of graphs under edge addition (Q6081580) (← links)
- Decreasing the mean subtree order by adding <i>k</i> edges (Q6144910) (← links)