- #1

- 73

- 0

Grapgh G = (N, A), N = set of points of nodes, and A = set of arcs; an arc is an edge from node i to a different node j from N.

Any suggestions?

- Thread starter jetoso
- Start date

- #1

- 73

- 0

Grapgh G = (N, A), N = set of points of nodes, and A = set of arcs; an arc is an edge from node i to a different node j from N.

Any suggestions?

- #2

AKG

Science Advisor

Homework Helper

- 2,565

- 4

- #3

- 73

- 0

- #4

- 1,356

- 2

label the nodes. and then show that there exists a spantree

- #5

- 73

- 0

- #6

matt grime

Science Advisor

Homework Helper

- 9,395

- 3

conversely, if there is a cycle C and we remove some edge from between x and y then it is still connected since the resulting graph is the union of the connected component containing x, the connected component containing y, and x and y are still connected by the complement ot the removed edge in the arc.

connectivity is transitive: if r is connnected to s and s is connected to t then r is connected to t.

- Last Post

- Replies
- 3

- Views
- 2K

- Last Post

- Replies
- 1

- Views
- 2K

- Last Post

- Replies
- 10

- Views
- 2K

- Last Post

- Replies
- 3

- Views
- 1K

- Last Post

- Replies
- 3

- Views
- 2K

- Last Post

- Replies
- 4

- Views
- 7K

- Last Post

- Replies
- 1

- Views
- 1K

- Last Post

- Replies
- 6

- Views
- 4K

- Last Post

- Replies
- 1

- Views
- 2K

- Last Post

- Replies
- 3

- Views
- 3K