Theorems · Definition · combinatorics
SimpleGraph.degMatrix
{V : Type u_1} →
(R : Type u_2) →
[Fintype V] → (G : SimpleGraph V) → [DecidableRel G.Adj] → [DecidableEq V] → [AddMonoidWithOne R] → Matrix V V RThe diagonal matrix consisting of the degrees of the vertices in the graph.
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 59 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Fintypestatement and proof · cited by 7,736
- Matrixstatement · cited by 4,303
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement and proof · cited by 1,346
- Matrix.diagonalproof · cited by 314
- AddMonoidWithOnestatement and proof · cited by 313
- SimpleGraph.degreeproof · cited by 112
Cited by8
Results whose statement or proof uses this declaration.
- SimpleGraph.lapMatrixproof · cited by 16
- SimpleGraph.lapMatrix_toLinearMap₂'proof · cited by 2
- SimpleGraph.isHermitian_degMatrixstatement · cited by 1
- SimpleGraph.isSymm_degMatrixstatement · cited by 1
- SimpleGraph.degMatrix_mulVec_applystatement · cited by 1
- SimpleGraph.dotProduct_mulVec_degMatrixstatement · cited by 1
- SimpleGraph.lapMatrix_mulVec_applyproof · cited by 1
- SimpleGraph.degMatrix.congr_simpstatement and proof · cited by 0