% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/network-summary.R
\name{network_vertex_connectivity}
\alias{network_vertex_connectivity}
\title{Network Vertex Connectivity}
\usage{
network_vertex_connectivity(x, ...)
}
\arguments{
\item{x}{Network input: matrix, igraph, network, cograph_network, or tna object}

\item{...}{Additional arguments passed to \code{\link{to_igraph}}}
}
\value{
Integer: minimum vertex cut size
}
\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.
}
\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
}
