Definition:Boundary (Graph Theory)/Simple Graph
Jump to navigation
Jump to search
This page is about the boundary of a vertex in the context of Graph Theory. For other uses, see Boundary.
Definition
Let $G = \tuple {V, E}$ be a simple graph.
Let $v \in V$ be a vertex of $G$.
Then the boundary of $v$ is the set of all vertices of $G$ which are adjacent to $v$:
- $\map B v = \set {u \in V: \set {u, v} \in E}$
Also see
- Results about boundaries in the context of graph theory can be found here.
Sources
There are no source works cited for this page. Source citations are highly desirable, and mandatory for all definition pages. Definition pages whose content is wholly or partly unsourced are in danger of having such content deleted. To discuss this page in more detail, feel free to use the talk page. |