next | previous | forward | backward | up | top | index | toc | Macaulay2 website

Graphs :: criticalEdges

criticalEdges -- Finds the critical edges of a graph

Synopsis

Usage:

C = criticalEdges G
Inputs:
- G, an instance of the type Graph,
Outputs:
- C, a list, the critical edges of G

Description

A critical edge is an edge such that the removal of the edge from the graph increases the graph's independence number.

i1 : G = graph({{1,2},{2,3},{3,1},{3,4},{4,1},{4,2},{4,5}},EntryMode=>"edges");

i2 : criticalEdges G

o2 = {set {1, 2}, set {1, 3}, set {2, 3}}

o2 : List

See also

independenceNumber -- computes the independence number of a graph

Ways to use `criticalEdges` :

"criticalEdges(Graph)"

For the programmer

The object criticalEdges is a method function.