Dom-Chromatic Number of Certain Ladder Graphs

Main Article Content

Joice Punitha M., Beulah Angeline E. F., Helda Mercy M.


The dom-coloring set of a graph G is a non-empty subset S of V (G) such that S is a dominating set of G, which contains atleast one vertex from each color class of G. The minimum cardinality of a dom-coloring set is called the dom- chromatic number of the graph G and is denoted by γdc(G). In this paper, we have designed an algorithm called the dom-coloring algorithm and also determined the dom-chromatic number of certain ladder graphs like Mobius ladder graphs and circular ladder graphs.

Article Details