Theorems · Theorem · combinatorics
SimpleGraph.radius_eq_top_of_not_connected
∀ {α : Type u_1} {G : SimpleGraph α}, ¬G.Connected → G.radius = ⊤- Defined in
- Mathlib.Combinatorics.SimpleGraph.Diam
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 36 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Top.topstatement and proof · cited by 9,680
- ENatstatement · cited by 4,985
- SimpleGraphstatement and proof · cited by 3,072
- iInfproof · cited by 1,690
- SimpleGraph.Connectedstatement and proof · cited by 75
- iInf_topproof · cited by 21
- SimpleGraph.radiusstatement · cited by 20
- SimpleGraph.eccent_eq_top_of_not_connectedproof · cited by 2
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.radius_botproof · cited by 1
- SimpleGraph.radius_ne_top_iffproof · cited by 0