Connected Graph/Examples/Arbitrary Example 1

Example of Connected Graph

The following is an example of a connected graph with $5$ vertices and $6$ edges.

Vertex $C$ is adjacent to vertex $A$ but not to vertex $B$

There are $2$ paths of length $2$ from $B$ to $C$, that is $\tuple {B, A, C}$ and $\tuple {B, D, C}$

There are a several cycles, including $\tuple {B, D, E, B}$.

Sources

• 1997: Donald E. Knuth: The Art of Computer Programming: Volume 1: Fundamental Algorithms (3rd ed.) ... (previous) ... (next): $\S 2.3.4.1$: Free Trees