A Study on Graphs |

ABSTRACT:

Agraph G consists of a nonempty set V (G) of objects called vertices and a(possibly empty) set E (G) of two element subsets of V (G), called edges. Theset V (G) is called the vertex set of G and E (G) its edge set. The number ofvertices in a graph G is called its order, and the number of edges is its size.A graph of order p and size q is called a (p, q)-graph.