Topic: Paths, Cycles and Connectedness

Why Radius Does Not Exceed Diameter

Walks and Walk Length

Turning Any Walk Into a Path

Trails and Edge Reuse

The Triangle Inequality for Graph Distance

The Diameter Is at Most Twice the Radius

Reachability as an Equivalence Relation

Radius and Central Vertices

Paths and Simple Routes

Maximal Connected Subgraphs