Processing math: 100%
Skip to contents

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.

Value

A logical scalar, whether the supplied vertex set is a (minimal) vertex separator or not. lists all vertex separator of minimum size.

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 n1 vertices is considered to be a vertex separator.