Corona Domination Number of Some Ladder Graphs

Abstract

Corona domination was initiated by G. Mahadevan, et.al. in 2021 [4].  A subset S of a vertex set V is called a dominating set of a graph if every vertex of V − S is adjacent with at least one vertex (point) in S.  The dominating set S is called a corona dominating set (CD-set), if every vertex in < S > is either a pendant vertex or a support vertex. The cardinality which is minimum among all CD-sets is known as corona domination number and is represented by (G).  This paper investigates the corona domination number of some ladder graphs.