In graph theory, a vertex subset S ⊂ V {\displaystyle S\subset V} is a vertex separator (or vertex cut, separating set) for nonadjacent vertices a and b if the removal of S from the graph separates a and b into distinct connected components. == Examples == Consider a grid graph with r rows and c columns; the total number n of vertices is r × c.
In graph theory, a vertex subset S ⊂ V {\displaystyle S\subset V} is a vertex separator (or vertex cut, separating set) for nonadjacent vertices a and b if the removal of S from the graph separates a and b into distinct connected components. == Examples == Consider a grid graph with r rows and c columns; the total number n of vertices is r × c.
Source: Wikipedia "Vertex separator" · CC BY-SA 4.0
Share this article: X · Bluesky