Definition:Adjacent (Graph Theory)/Edges/Non-Adjacent
< Definition:Adjacent (Graph Theory) | Edges(Redirected from Definition:Non-Adjacent Edges (Graph Theory))
Jump to navigation
Jump to search
Definition
Let $G = \struct {V, E}$ be a graph.
Two edges $u, v \in V$ of $G$ are non-adjacent if and only if they are not adjacent.
Also see
- Results about adjacency in the context of graph theory can be found here.
Sources
- 1977: Gary Chartrand: Introductory Graph Theory ... (previous) ... (next): Chapter $1$: Mathematical Models: $\S 1.3$: Graphs