Boundary (graph theory)

In graph theory, the outer boundary of a subset $S$ of the vertices of a graph $G$ is the set of vertices in $G$ that are adjacent to vertices in $S$ , but not in $S$ themselves. The inner boundary is the set of vertices in $S$ that have a neighbor outside $S$ . The edge boundary is the set of edges with one endpoint in the inner boundary and one endpoint in the outer boundary.[1]

These boundaries and their sizes are particularly relevant for isoperimetric problems in graphs, separator theorems, minimum cuts, expander graphs, and percolation theory.

References

Benjamini, Itai (2013), Coarse geometry and randomness: École d'Été de Probabilités de Saint-Flour XLI – 2011, Lect. Notes Math., vol. 2100, Cham: Springer, p. 2, doi:10.1007/978-3-319-02576-6, ISBN 978-3-319-02575-9

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.