Category:Definitions/Incidence (Graph Theory)
Jump to navigation
Jump to search
This category contains definitions related to incidence in the context of graph theory.
Related results can be found in Category:Incidence (Graph Theory).
Let $G = \struct {V, E}$ be an undirected graph.
Let $u, v \in V$ be vertices of $G$.
Let $e = \set {u, v} \in E$ be an edge of $G$:
Then:
- $u$ and $v$ are each incident with $e$
- $e$ is incident with $u$ and incident with $v$.
Pages in category "Definitions/Incidence (Graph Theory)"
The following 7 pages are in this category, out of 7 total.
I
- Definition:Incident (Graph Theory)/Also known as
- Definition:Incident (Graph Theory)/Digraph
- Definition:Incident (Graph Theory)/Digraph/Incident From
- Definition:Incident (Graph Theory)/Digraph/Incident To
- Definition:Incident (Graph Theory)/Planar Graph
- Definition:Incident (Graph Theory)/Undirected Graph
- Definition:Incident (Undirected Graph)