پل (نظریه گراف)
Sign in to saveAlso known as cut edge, cut arc, isthmus, graph bridge
edge of a graph whose deletion increases the graph's number of connected components; equivalently, an edge not contained in any cycle
Wikidata facts
- Subclass of
- edge
- Image
- Graph cut edges.svg
Show 4 more facts
- opposite of
- cut vertex
- studied by
- graph theory
- different from
- Most
- maintained by WikiProject
- WikiProject Mathematics
via Wikidata · CC0