GLOBAL EQUITABLE DOMINATION IN CARTESIAN PRODUCT OF GRAPHS

被引：0
|
作者：
Vaidya, S. K. [1 ]
Pandit, R. M. [2 ]
机构：
[1] Saurashtra Univ, Rajkot 360005, Gujarat, India
[2] Governement Polytech, Rajkot 360003, Gujarat, India
来源：
ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS | 2024年 / 41卷 / 05期
关键词：
global dominating set; equitable dominating set; global equitable dominating set; global equitable domination number; Cartesian product; NUMBER;
D O I：
10.17654/0974165824025
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The most famous open problem involving domination in graphs is Vizing's conjecture which states that the domination number of the Cartesian product of any two graphs is at least as large as the product of their domination numbers. In this paper, we investigate a similar problem for global equitable domination. In particular, we explore the multiplicative nature of the global equitable domination number (gamma(e)(g)) on the Cartesian products P-n square P-2, C-n square P-2 and C-n square K-m.
引用
收藏
页码：341 / 356
页数：16
相关论文
共 50 条
12345