PENDANT DOMINATION IN GRID GRAPHS

Abstract

Let  be a simple, finite and undirected graph. The set  of  is called a dominating set of  if each vertex not in  is adjacent to minimum one vertex in . The least cardinality of a dominating set is known as domination number, indicated by . A dominating set  in  is called a pendant dominating set if induced sub-graph of  contains at least one pendant vertex. The least cardinality of a pendant dominating set is known as the pendant domination number, indicated by . In this article, we determine the pendant domination number of some grid graphs.

Cite as

Nayaka S. R, Puttaswamy, & Purushothama S. (2022). PENDANT DOMINATION IN GRID GRAPHS. Journal of Applied Mathematics and Statistical Analysis, 3(3), 1–8. https://doi.org/10.5281/zenodo.7269675