Non-Blocker

graph-theory

Definition

Non-Blocker

Let $G=(V,E)$ be a connected graph.

A subset of edges $N\subseteq E$ is called non-blocker if the subgraph $G^{\prime }=(V,E-N)$ is still connected.

Connection to Spanning Trees

Intuitively, non-blockers are related to spanning trees. In a graph, non-blockers represent “redundant connections” between nodes that can be removed with the induced subgraph being still connected.