Theorems · Theorem · combinatorics

SimpleGraph.incMatrix_mul_transpose_apply_of_adj

∀ {R : Type u_1} {α : Type u_2} (G : SimpleGraph α) [inst : Fintype (Sym2 α)] [inst_1 : DecidableEq α]
  [inst_2 : DecidableRel G.Adj] [inst_3 : Semiring R] {a b : α},
  G.Adj a b → (SimpleGraph.incMatrix R G * (SimpleGraph.incMatrix R G).transpose) a b = 1

Defined in

Mathlib.Combinatorics.SimpleGraph.IncMatrix

Cited by

1 results in Mathlib

Foundations

Depth 83 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

FintypeDecidableEqDecidableRelSemiring