Vol. 4 No. 6 (2018) ·
Articles
Domination and Chromatic Number of Pan Graph and Lollipop Graph
Nigar Siddiqui
Department of Mathematics, SHUATS , IN
Mohit James
Department of Mathematics, SHUATS , IN
📅
Published: June 2018
Keywords: Domination number, Chromatic number, Pan graph, 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.
How to Cite
Nigar Siddiqui, Mohit James, “Domination and Chromatic Number of Pan Graph and Lollipop Graph,” International Journal of Technical Innovation in Modern Engineering & Science, vol. 4, no. 6, pp. 932-938, June 2018.
References
NA