The following pages link to Indistinguishable trees and graphs (Q489327):
Displaying 17 items.
- On the eccentric subtree number in trees (Q827611) (← links)
- Nonisomorphic graphs with the same t-polynomial (Q1089010) (← links)
- Indistinguishability of the components of random spanning forests (Q1660632) (← 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)
- Certain graph invariants do not distinguish all graphs (Q3484877) (← links)
- WHICH TREES ARE UNIQUELY FRAMED BY THE HEAWOOD GRAPH? (Q4288044) (← links)
- On the Mean Connected Induced Subgraph Order of Cographs (Q4616101) (← links)
- On the Mean Order of Connected Induced Subgraphs of Block Graphs (Q5109058) (← 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)
- On the maximum local mean order of sub-\(k\)-trees of a \(k\)-tree (Q6606327) (← links)
