Domination Number of Square of Cartesian Products of Cycles

• 作者: Morteza Alishahi Sakineh Hoseini Shalmaee
• 来源期刊: 离散数学期刊(英文)
• 学科: 数学
• 关键词: DOMINATION NUMBER SQUARE of a GRAPH CARTESIAN PRODUCT
• 年，卷（期）: 2015,（4）
• 页码范围: 88-94
• 页数: 7页
• 分类号: O1

摘要

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.