$\displaystyle G=(V,E)$ is a simple graph.

Prove:

e(G) >= 2 <=> $\displaystyle \forall i,j \in V$, have 2 chains connecting them.

Printable View

- Oct 25th 2007, 12:55 AMle_su14Graph theory
$\displaystyle G=(V,E)$ is a simple graph.

Prove:

e(G) >= 2 <=> $\displaystyle \forall i,j \in V$, have 2 chains connecting them.