Theorems · Definition · combinatorics
SimpleGraph.eccent
{α : Type u_1} → SimpleGraph α → α → ℕ∞The eccentricity of a vertex is the greatest distance between it and any other vertex.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Diam
- Cited by
- 28 results in Mathlib
- Foundations
- Depth 33 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- ENatstatement · cited by 4,985
- SimpleGraphstatement and proof · cited by 3,072
- iSupproof · cited by 2,415
- SimpleGraph.edistproof · cited by 55
Cited by31
Results whose statement or proof uses this declaration.
- SimpleGraph.ediamproof · cited by 44
- SimpleGraph.radiusproof · cited by 20
- SimpleGraph.centerproof · cited by 6
- SimpleGraph.eccent_ne_zerostatement and proof · cited by 5
- SimpleGraph.eccent_topstatement · cited by 4
- SimpleGraph.mem_center_iffstatement · cited by 4
- SimpleGraph.exists_eccent_eq_radiusstatement and proof · cited by 4
- SimpleGraph.edist_le_eccentstatement · cited by 4
- SimpleGraph.eccent_eq_zero_of_subsingletonstatement · cited by 2
- SimpleGraph.eccent_le_ediamstatement and proof · cited by 2
- SimpleGraph.radius_le_eccentstatement and proof · cited by 2
- SimpleGraph.eccent_eq_top_of_not_connectedstatement and proof · cited by 2