commit 3378ed2a1e8296f0bb6a0031b9368d6de63facd8
parent 0c698c6501ae26ffc3148c69e8e601d3d71c0d6c
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Sat, 6 Sep 2025 23:05:34 +0200
commit with codex
Diffstat:
4 files changed, 21 insertions(+), 3 deletions(-)
diff --git a/complete_graph b/complete_graph
@@ -0,0 +1,9 @@
+# Complete graph
+
+A *complete graph* is a [graph] on some set of [vertices] where every possible [edge] exists. When it is found as a [subgraph] or [induced_subgraph] of another [graph], it is called a [clique]
+
+Complete graphs can be [undirected_graphs], or [directed_graphs]. In the latter case, all [directed_edges] are [bidirectional_edges]; there may or may not be [self_loops]
+
+Up: [graph_family]
+
+Aliases: graph complete
diff --git a/cycle b/cycle
@@ -4,11 +4,10 @@ A [simple_path] from one [vertex] to itself (= the path is simple except that th
In [undirected_graphs], cycles are typically required to have length at least 3 ([triangle]).
-In [directed_graphs], two vertices u and v with an [edge] from u to v and another [edge] from v to u can count as a cycle;
- - [self_loops] can arguably count as a cycle as well
+In [directed_graphs], we have [directed_cycles]
Variants:
-- [circuit_graph] if the same [vertices] (but not [edges]) can be visited multiple times
+- [circuit_(graph)] if the same [vertices] (but not [edges]) can be visited multiple times
- like a [trail] compared to a [simple_path]
- [tour] if the same [vertices] and [edges] can be visited multiple times
- like a [walk] compared to a [simple_path]
diff --git a/cycle_directed b/cycle_directed
@@ -0,0 +1,9 @@
+# Directed cycles
+
+A *directed_cycle* is a [cycle] in a [directed_graph], which respects the orientation of the [edges]
+
+Two vertices u and v with an [edge] from u to v and another [edge] from v to u can then count as a directed cycle. Further,[self_loops] can arguably count as a cycle as well
+
+Up: [cycle]
+
+Aliases: directed cycle, directed cycles, cycles directed
diff --git a/graph_family b/graph_family
@@ -19,6 +19,7 @@ A (generally [infinite]) set of [graphs]
- [wall_graph]
- [strongly_connected_graph]
- [graph_series_parallel]
+- [complete_graph]
- [chordal]
- [planar_graph]
