2 problems
- 0 votes0 replies0 views
Maximum-size biconnected digraphs of given radius
Let and . Let be the digraph specified in the paper, and let denote the family obtained by the…
- 0 votes0 replies0 views
Chartrand–Oellermann–Tian–Zou conjecture on Steiner diameter and radius
Let be an integer, and let be a connected graph of order . The Steiner -diameter is the maximum Steiner distance over all -…