Large reflexive graphs
Content created by Fredrik Bakke.
Created on 2024-03-24.
Last modified on 2024-10-16.
module graph-theory.large-reflexive-graphs where
Idea
A large reflexive graph¶ is a large directed graph equipped with a loop edge at every vertex.
Definition
record Large-Reflexive-Graph (α : Level → Level) (β : Level → Level → Level) : UUω where field vertex-Large-Reflexive-Graph : (l : Level) → UU (α l) edge-Large-Reflexive-Graph : {l1 l2 : Level} → vertex-Large-Reflexive-Graph l1 → vertex-Large-Reflexive-Graph l2 → UU (β l1 l2) refl-Large-Reflexive-Graph : {l : Level} (x : vertex-Large-Reflexive-Graph l) → edge-Large-Reflexive-Graph x x open Large-Reflexive-Graph public
See also
External links
- Reflexive graph at Lab
- Graph on Wikidata
- Directed graph at Wikipedia
- Reflexive graph at Wolfram MathWorld
Recent changes
- 2024-10-16. Fredrik Bakke. Some links in elementary number theory (#1199).
- 2024-03-24. Fredrik Bakke. Some notions of graphs (#1091).