Definition:Boundary (Graph Theory)

This page is about the boundary of a vertex in the context of Graph Theory. For other uses, see Boundary.

This article is complete as far as it goes, but it could do with expansion. In particular: other types of graph You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding this information. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Expand}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.

Definition

Simple Graph

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.