Domination and Chromatic Number of Pan Graph and Lollipop Graph

Abstract

Domination number and Chromatic number are important characteristics of a graph. Lollipop and Pan Graphs are special types of Graphs. A dominating set of a graph G = (V, E) is a subset D of E such that every vertex not in D is adjacent to atleast one vertex of D .The domination number  (G) of a graph G is the cardinality of a smallest dominating set. In this paper, we determine the domination number and chromatic number of pan graph and lollipop graph.