Graph Theory
1. Let η be a graph and two distinct u and v vertices in it.
Suppose there exists at least two paths connecting them, then η is
cyclic.