OUTER-CONNECTED 2-DOMINATING SETS OF GRAPHS

被引：1

作者：

Canoy, Sergio R., Jr. ^{[1
]}

Domoloan, Bernadette D. ^{[1
]}

机构：

[1] MSU Iligan Inst Technol, Dept Math & Stat, Coll Sci & Math, Iligan 9200, Philippines

来源：

ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS | 2019年 / 20卷 / 01期

关键词：

2-domination; outer-connected; join; corona; lexicographic product; DOMINATION;

D O I：

10.17654/DM020010025

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G = (V(G), E(G)) be a simple graph. A subset S of V(G) is an outer-connected 2-dominating set of G if S is a 2-dominating set of G and the graph < V(G)\S > is connected. The outer-connected 2-domination number of G, denoted by gamma(c)(2)(G), is the smallest cardinality of an outer-connected 2-dominating set of G. In this paper, we characterize the outer-connected 2-dominating sets of the join, corona, and lexicographic product of graphs. As direct consequences, the corresponding bounds or exact values of the outer-connected 2-domination numbers of these graphs are obtained.

引用

页码：25 / 36

页数：12