Perfect Isolate Domination in Graphs

被引：2
|
作者：
Armada, Cris L. [1 ,3 ]
Hamja, Jamil J. [2 ]
机构：
[1] Cebu Normal Univ, Coll Arts & Sci, Math Dept, Cebu, Philippines
[2] MSU Tawi Tawi Coll Technol & Oceanog, Off Vice Chancellor Acad Affairs, Tawi Tawi 7500, Philippines
[3] Cebu Normal Univ, Ctr Res & Dev, Cebu, Philippines
来源：
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS | 2023年 / 16卷 / 02期
关键词：
Perfect domination; isolate domination; perfect isolate domination;
D O I：
10.29020/nybg.ejpam.v16i2.4760
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let G = (V (G), E(G)) be a simple connected graph. A set S subset of V (G) is said to be a perfect isolate dominating set of G if S is a perfect dominating set and an isolate dominating set of G. The minimum cardinality of a perfect isolate dominating set of G is called perfect isolate domination number, and is denoted by gamma p0(G). A perfect isolate dominating set S with |S| = gamma p0(G) is said to be gamma p0-set. In this paper, the author gives a characterization of perfect isolate dominating set of some graphs and graphs obtained from the join, corona and lexicographic product of two graphs. Moreover, the perfect isolate domination number of the forenamed graphs is determined and also, graphs having no perfect isolate dominating set are examined.
引用
收藏
页码：1326 / 1341
页数：16
相关论文
共 50 条
12345