- #1

jetoso

- 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?

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- Thread starter jetoso
- Start date

- #1

jetoso

- 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,566

- 4

- #3

jetoso

- 73

- 0

- #4

neurocomp2003

- 1,366

- 3

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

- #5

jetoso

- 73

- 0

- #6

matt grime

Science Advisor

Homework Helper

- 9,426

- 4

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.

Share:

- Last Post

- Replies
- 7

- Views
- 2K

- Last Post

- Replies
- 17

- Views
- 652

- Last Post

- Replies
- 1

- Views
- 327

- Replies
- 7

- Views
- 1K

- Last Post

- Replies
- 2

- Views
- 339

- Last Post

- Replies
- 1

- Views
- 414

- Last Post

- Replies
- 17

- Views
- 2K

- Last Post

- Replies
- 23

- Views
- 529

- Last Post

- Replies
- 1

- Views
- 1K

- Last Post

- Replies
- 2

- Views
- 304