The girth of a graph is the length of its smallest cycle


Question: 1. Prove that the graph shown in Figure is non-planar.

1313_28.png

2. The girth of a graph is the length of its smallest cycle. Use this to generalize the statements and proofs of Theorems I and II.

Theorems I: If G is simple, planar, and connected and has at least three vertices, then 3|F(G)| ≤ 2|E(G)|.

Theorems II: If G is simple, planar, connected, and has no 3-cycles, then 4|F(G)| ≤ 2|E(G)|.

Solution Preview :

Prepared by a verified Expert
Mathematics: The girth of a graph is the length of its smallest cycle
Reference No:- TGS02381284

Now Priced at $10 (50% Discount)

Recommended (92%)

Rated (4.4/5)