Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.isAdjMatrix_adjMatrix

∀ (α : Type u_1) {V : Type u_2} (G : SimpleGraph V) [inst : DecidableRel G.Adj] [inst_1 : Zero α] [inst_2 : One α],
  (SimpleGraph.adjMatrix α G).IsAdjMatrix

The adjacency matrix of G is an adjacency matrix.

Defined in
Mathlib.Combinatorics.SimpleGraph.AdjMatrix
Cited by
2 results in Mathlib
Foundations
Depth 18 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
DecidableRelZeroOne
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

SimpleGraph.isHermitian_adjMatrix · cited by 1SimpleGraph.isHermitian_a…SimpleGraph.toGraph_adjMatrix_eq · cited by 0SimpleGraph.toGraph_adjMa…SimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjSimpleGraph.adjMatrix · cited by 48SimpleGraph.adjMatrixMatrix.IsAdjMatrix · cited by 28Matrix.IsAdjMatrixSimpleGraph.isAdjMatrix_adjMa…CITED BYCITES

Cites4

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by2

Results whose statement or proof uses this declaration.