Theorems · Theorem · combinatorics

Matrix.IsAdjMatrix.adjMatrix_toGraph_eq

∀ {α : Type u_1} {V : Type u_2} [inst : MulZeroOneClass α] [inst_1 : Nontrivial α] {A : Matrix V V α}
  (h : A.IsAdjMatrix) [inst_2 : DecidableEq α], SimpleGraph.adjMatrix α h.toGraph = A

If A is qualified as an adjacency matrix, then the adjacency matrix of the graph induced by A is itself.

Defined in

Mathlib.Combinatorics.SimpleGraph.AdjMatrix

Cited by

0 results in Mathlib

Foundations

Depth 22 from the axioms · uses propext, Quot.sound

Assumes

MulZeroOneClassNontrivialDecidableEq