bn:00495606n
Noun Concept
Categories: Graph connectivity
EN
bridge  bridgeless graph  cut-edge  cut arc  cut edge
EN
In graph theory, a bridge, isthmus, cut-edge, or cut arc is an edge of a graph whose deletion increases the graph's number of connected components. Wikipedia
English:
graph theory
graph
Definitions
Relations
Sources
EN
In graph theory, a bridge, isthmus, cut-edge, or cut arc is an edge of a graph whose deletion increases the graph's number of connected components. Wikipedia
An edge whose removal disconnects a graph Wikipedia Disambiguation
An edge which, if removed, changes a connected graph to one that is not connected. Wiktionary
Wikipedia
Wikidata
EN
Wiktionary
EN
Wikipedia Redirections
Wikidata Alias