Theorems · Theorem · combinatorics

SimpleGraph.compl_adjMatrix_eq_adjMatrix_compl

∀ (α : Type u_1) {V : Type u_2} (G : SimpleGraph V) [inst : DecidableRel G.Adj] [inst_1 : DecidableEq V]
  [inst_2 : DecidableEq α] [inst_3 : Zero α] [inst_4 : One α],
  (SimpleGraph.adjMatrix α G).compl = SimpleGraph.adjMatrix α Gᶜ

Defined in

Mathlib.Combinatorics.SimpleGraph.AdjMatrix

Cited by

1 results in Mathlib

Foundations

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

Assumes

DecidableRelDecidableEqDecidableEqZeroOne