Part a: Suppose that a Fullerene graph has exactly P pentagons and H hexagons. In terms of P, and H, how many edges does the Fullerene graph have? How many vertices does it have?
WHY (A)? EXPLAIN ME PLEASE STEP BY STEP


Handshaking Theorem: This theorem says that, in any graph the sum of degree of all vertices is equal to the twice of number of edges in that graph.
Euler's Formula: The relation between number of vertices , number of edges and number of faces of a graph is
Consider a Fullerene graph with exactly pentagon and hexagon. Therefore total number of Faces are .
Let total number of vertices in the Fullerene graph are and total number of edges are . Since degree of each vertices in Fullerene graph is , therefore sum of degree of all vertices is , therefore applying Handshaking Theorem:
Step by step
Solved in 2 steps









