Theorems · Theorem · combinatorics

SimpleGraph.adjMatrix_hadamard_diagonal

∀ (α : Type u_1) {V : Type u_2} (G : SimpleGraph V) [inst : DecidableRel G.Adj] [inst_1 : DecidableEq V]
  [inst_2 : MulZeroOneClass α] (d : V → α), (SimpleGraph.adjMatrix α G).hadamard (Matrix.diagonal d) = 0

Defined in

Mathlib.Combinatorics.SimpleGraph.AdjMatrix

Cited by

4 results in Mathlib

Foundations

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

Assumes

DecidableRelDecidableEqMulZeroOneClass