Double domination number of graphs generated from unary products

被引：0
|
作者：
Magima, M. [1 ]
Ragukumar, P. [1 ]
机构：
[1] Vellore Inst Technol Vellore, Dept Math, Vellore 632014, Tamil Nadu, India
来源：
NOTES ON NUMBER THEORY AND DISCRETE MATHEMATICS | 2024年 / 30卷 / 03期
关键词：
Domination; Double domination; Unary products;
D O I：
10.7546/nntdm.2024.30.3.640-653
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A subset S of V(G) is a double dominating set of a graph G if S dominates every vertex of G at least twice. The minimum cardinality of a double dominating set denoted by gamma 2x(G), is the double domination number of G . In this paper, we identified the double domination number of graphs generated by applying various unary operations on standard graph classes.
引用
收藏
页码：640 / 653
页数：14
相关论文
共 50 条
12345