network_vertex_connectivity: Network Vertex Connectivity

In cograph: Analysis and Visualization of Complex Networks

Network Vertex Connectivity

Description

Computes the vertex connectivity of a network - the minimum number of vertices that must be removed to disconnect the graph (or make it trivial). Higher values indicate more robust network structure.

Usage

network_vertex_connectivity(x, ...)

Arguments

x	Network input: matrix, igraph, network, cograph_network, or tna object
...	Additional arguments passed to to_igraph

Value

Integer: minimum vertex cut size

Examples

# Complete graph K4 has vertex connectivity 3
k4 <- matrix(1, 4, 4); diag(k4) <- 0
network_vertex_connectivity(k4)  # 3

# Path graph has vertex connectivity 1
path <- matrix(c(0,1,0,0, 1,0,1,0, 0,1,0,1, 0,0,1,0), 4, 4)
network_vertex_connectivity(path)  # 1

cograph documentation built on April 1, 2026, 1:07 a.m.