is_min_separator: Minimal vertex separators

In igraph: Network Analysis and Visualization

Minimal vertex separators

Description

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

Usage

is_min_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_min_separator() decides whether the supplied vertex set is a minimal vertex separator. A minimal vertex separator is a vertex separator, such that none of its proper subsets are a vertex separator.

Value

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

Related documentation in the C library

igraph_is_minimal_separator().

See Also

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

Examples

# The graph from the Moody-White paper
mw <- graph_from_literal(
  1 - 2:3:4:5:6, 2 - 3:4:5:7, 3 - 4:6:7, 4 - 5:6:7,
  5 - 6:7:21, 6 - 7, 7 - 8:11:14:19, 8 - 9:11:14, 9 - 10,
  10 - 12:13, 11 - 12:14, 12 - 16, 13 - 16, 14 - 15, 15 - 16,
  17 - 18:19:20, 18 - 20:21, 19 - 20:22:23, 20 - 21,
  21 - 22:23, 22 - 23
)

# Cohesive subgraphs
mw1 <- induced_subgraph(mw, as.character(c(1:7, 17:23)))
mw2 <- induced_subgraph(mw, as.character(7:16))
mw3 <- induced_subgraph(mw, as.character(17:23))
mw4 <- induced_subgraph(mw, as.character(c(7, 8, 11, 14)))
mw5 <- induced_subgraph(mw, as.character(1:7))

check.sep <- function(G) {
  sep <- min_separators(G)
  sapply(sep, is_min_separator, graph = G)
}

check.sep(mw)
check.sep(mw1)
check.sep(mw2)
check.sep(mw3)
check.sep(mw4)
check.sep(mw5)

igraph documentation built on Oct. 20, 2024, 1:06 a.m.