Forcing Subsets of Connected Co-Independent Hop Domination in the Edge Corona and Lexicographic Product of Graphs

被引:0
作者
Calanza, Yves Dave L. [1 ]
Rara, Helen M. [2 ]
机构
[1] Mindanao State Univ Iligan Inst Technol, Dept Math & Stat, Coll Sci & Math, Iligan 9200, Philippines
[2] Mindanao State Univ Iligan Inst Technol, Dept Math & Stat, Coll Sci & Math, Ctr Graph Theory Algebra & Anal Premier Res Inst S, Iligan 9200, Philippines
来源
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS | 2022年 / 15卷 / 04期
关键词
Key Words and Phrases; Forcing subsets; connected co-independent hop; domination; co-independent set; edge corona; lexicographic product; NUMBER;
D O I
10.29020/nybg.ejpam.v15i4.4521
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
This study deals with the forcing subsets of a minimum connected co-independent hop dominating sets in graphs. Bounds or exact values of the forcing connected co-independent hop domination numbers of graphs resulting from some binary operations such as edge corona and lexicographic product of graphs are determined.Some main results generated in this study include: (a) characterization of the minimum connected co-independent hop dominating sets; and (b) characterization of the forcing subsets for these types of sets.
引用
收藏
页码:1597 / 1612
页数:16
相关论文
共 16 条
[11]   INNATE DEGREE OF FREEDOM OF A GRAPH [J].
KLEIN, DJ ;
RANDIC, M .
JOURNAL OF COMPUTATIONAL CHEMISTRY, 1987, 8 (04) :516-521
[12]   On Connected Co-Independent Hop Domination in Graphs [J].
Nanding, Sandra A. ;
Rara, Helen M. .
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2021, 14 (04) :1226-1236
[13]   Hop Domination in Graphs-II [J].
Natarajan, C. ;
Ayyaswamy, S. K. .
ANALELE STIINTIFICE ALE UNIVERSITATII OVIDIUS CONSTANTA-SERIA MATEMATICA, 2015, 23 (02) :187-199
[14]  
Pabilona Y., 2017, OURNAL ALGEBRA APPL
[15]   Connected hop domination in graphs under some binary operations [J].
Pabilona, Yamilita M. ;
Rara, Helen M. .
ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2018, 11 (05)
[16]  
Salasalan G. P., 2021, EUR J PURE APPL MATH, V14