This method creates a list of all possible graphs obtainable from the given graph by removing one edge. Notice that isomorphic graphs are allowed within the list.
i1 : removeEdges graph {{1,2},{1,3},{2,3},{3,4},{4,5}} o1 = {Graph{0 => {2} }, Graph{0 => {1} }, Graph{0 => {1, 2}}, Graph{0 => {1, 2}}, Graph{0 => {1, 2} }} 1 => {2} 1 => {0, 2} 1 => {0} 1 => {0, 2} 1 => {0, 2} 2 => {0, 1, 3} 2 => {1, 3} 2 => {0, 3} 2 => {1, 0} 2 => {1, 0, 3} 3 => {2, 4} 3 => {2, 4} 3 => {2, 4} 3 => {4} 3 => {2} 4 => {3} 4 => {3} 4 => {3} 4 => {3} 4 => {} o1 : List |
If the List input format is used, then one should use care as the list may contain isomorphic pairs.
The object removeEdges is a method function with options.