Revision history [back]

Given a graph G then G.random_subgraph(.5) returns a random subgraph of G (each vertex is selected with probability .5)

However, this will return an induced subgraph.

(1) Is there a command that returns a general subgraph (not necessarily induced)?

(2) Is there a command that returns a connected subgraph (let's say starting with a connected G)?

Given a graph G then G.random_subgraph(.5) returns a random subgraph of G (each vertex is selected with probability .5)

However, this will return an induced subgraph.

(1) Is there a command that returns a general subgraph (not necessarily induced)?

(2) Is there a command that returns a connected subgraph (let's say starting with a connected G)?

Given a graph G then G.random_subgraph(.5) returns a random subgraph of G (each vertex is selected with probability .5)

Is there a command that returns a connected subgraph (let's say starting with a connected G)?

Given a graph G then G.random_subgraph(.5) returns a random subgraph of G (each vertex is selected with probability .5)

However, this will return an induced subgraph.

Is there a command that returns a connected subgraph (let's say starting with a connected G)?not necessarily induced subgraph?

Given a graph G then G.random_subgraph(.5) returns a random subgraph of G (each vertex is selected with probability .5)

However, this will return an induced subgraph.

Is there a command that returns a not necessarily induced subgraph?

Given a graph G then G.random_subgraph(.5) returns a random subgraph of G (each vertex is selected independently with probability .5)

However, this will return an induced subgraph.

Is there a command that returns a not necessarily induced subgraph?

Given a graph G then G.random_subgraph(.5) returns a random subgraph of G (each vertex is selected independently with probability .5).5).

However, this will return an induced subgraph.

Is there a command that returns a not necessarily induced subgraph?