TITLE:
Domination Number of Square of Cartesian Products of Cycles
AUTHORS:
Morteza Alishahi, Sakineh Hoseini Shalmaee
KEYWORDS:
Domination Number, Square of a Graph, Cartesian Product
JOURNAL NAME:
Open Journal of Discrete Mathematics,
Vol.5 No.4,
October
29,
2015
ABSTRACT: A set is a dominating set of G if every vertex of is adjacent to at least one vertex of S. The cardinality of the smallest
dominating set of G is called the
domination number of G. The square G2 of a graph G is obtained from G by adding new edges between every two vertices having distance 2
in G. In this paper we study the
domination number of square of graphs, find a bound for domination number of
square of Cartesian product of cycles, and find the exact value for some of
them.