is_separator: Vertex separators

In igraph: Network Analysis and Visualization

Vertex separators

Description

Check whether a given set of vertices is a vertex separator.

Usage

is_separator(graph, candidate)

Arguments

graph	The input graph. It may be directed, but edge directions are ignored.
candidate	A numeric vector giving the vertex ids of the candidate separator.

Details

is_separator() decides whether the supplied vertex set is a vertex separator. A vertex set is a vertex separator if its removal results a disconnected graph.

In the special case of a fully connected graph with n vertices, each set of n-1 vertices is considered to be a vertex separator.

Value

A logical scalar, whether the supplied vertex set is a (minimal) vertex separator or not.

See Also

is_min_separator(), min_separators() lists all vertex separator of minimum size.

Other flow: dominator_tree(), edge_connectivity(), is_min_separator(), max_flow(), min_cut(), min_separators(), min_st_separators(), st_cuts(), st_min_cuts(), vertex_connectivity()

igraph documentation built on Aug. 10, 2023, 9:08 a.m.