Hi all,

I have as inputs a simple graph G and a subgraph H. I want as output the graph G-H, defined as the graph obtained from G by removing the edges of H (without removing any vertices).

Thank you.

1 | initial version |

Hi all,

I have as inputs a simple graph G and a subgraph H. I want as output the graph G-H, defined as the graph obtained from G by removing the edges of H (without removing any vertices).

Thank you.

Hi all,

I have as inputs a simple graph G and a subgraph H. I want as output the graph G-H, defined as the graph obtained from G by removing the edges of H (without removing any vertices).

H is given like this: H=G.random_subgraph(.25)

Thank you.

Hi all,

H is given like this: H=G.random_subgraph(.25)

Thank you.

Hi all,

H is given like this: H=G.random_subgraph(.25)

Is there a command like G.delete_edges(H) that returns the desired graph?

Thank you.

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.