Theorems · Theorem · combinatorics
SimpleGraph.edist_comm
∀ {V : Type u_1} {G : SimpleGraph V} {u v : V}, G.edist u v = G.edist v u- Defined in
- Mathlib.Combinatorics.SimpleGraph.Metric
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 34 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites17
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setproof · cited by 53,352
- Set.imageproof · cited by 5,609
- ENatstatement and proof · cited by 4,985
- Set.rangeproof · cited by 4,705
- Set.univproof · cited by 3,945
- SimpleGraphstatement and proof · cited by 3,072
- InfSet.sInfproof · cited by 935
- SimpleGraph.Walkproof · cited by 915
- Set.image_univproof · cited by 322
- SimpleGraph.Walk.lengthproof · cited by 212
- Set.image_compproof · cited by 142
- SimpleGraph.ediststatement and proof · cited by 55
Cited by4
Results whose statement or proof uses this declaration.
- SimpleGraph.ediam_le_two_mul_eccentproof · cited by 1
- SimpleGraph.mem_ball_commproof · cited by 0
- SimpleGraph.dist_commproof · cited by 0
- SimpleGraph.ediam_le_two_mul_radiusproof · cited by 0