Convex domination in the composition and cartesian product of graphs

被引：0

作者：

Mhelmar A. Labendia

Sergio R. Canoy

机构：

[1] Mindanao State University—Iligan Institute of Technology,Department of Mathematics, College of Science and Mathematics

来源：

Czechoslovak Mathematical Journal | 2012年 / 62卷

关键词：

convex dominating set; convex domination number; clique dominating set; composition; Cartesian product; 05C69;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

In this paper we characterize the convex dominating sets in the composition and Cartesian product of two connected graphs. The concepts of clique dominating set and clique domination number of a graph are defined. It is shown that the convex domination number of a composition G[H] of two non-complete connected graphs G and H is equal to the clique domination number of G. The convex domination number of the Cartesian product of two connected graphs is related to the convex domination numbers of the graphs involved.

引用

页码：1003 / 1009

页数：6