Geodetic Hop Dominating Sets in a Graph

被引：4
|
作者：
Saromines, Chrisley Jade C. [1 ]
Canoy Jr, Sergio R. [1 ]
机构：
[1] MSU Iligan Inst Technol, Coll Sci & Math, Ctr Graph Theory Algebra & Anal PRISM, Dept Math & Stat, Iligan 9200, Philippines
来源：
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS | 2023年 / 16卷 / 01期
关键词：
  Geodetic domination; hop domination; corona; lexicographic; NUMBER; BOUNDS; JOIN;
D O I：
10.29020/nybg.ejpam.v16i1.4646
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let G be an undirected graph with vertex and edge sets V (G) and E(G), respectively. A subset S of vertices of G is a geodetic hop dominating set if it is both a geodetic and a hop dominating set. The geodetic hop domination number of G, gamma hg(G), is the minimum cardinality among all geodetic hop dominating sets in G. Geodetic hop dominating sets in a graph resulting from some binary operations have been characterized. These characterizations have been used to determine some tight bounds for the geodetic hop domination number of each of the graphs considered. 2020 Mathematics Subject Classifications: 05C69
引用
收藏
页码：5 / 17
页数：13
相关论文
共 50 条
  • [41] Connected D-Hop dominating sets in wireless ad hoc networks
    Vuong, THP
    Huynh, DT
    6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL IV, PROCEEDINGS: MOBILE/WIRELESS COMPUTING AND COMMUNICATION SYSTEMS I, 2002, : 54 - 58
  • [42] Connected d-hop dominating sets in mobile ad hoc networks
    Nguyen, Trac N.
    Huynh, Dung T.
    2006 4TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC AND WIRELESS NETWORKS, VOLS 1 AND 2, 2006, : 138 - +
  • [43] Construction of d-Hop Connected Dominating Sets in Wireless Sensor Networks
    Zheng, Chan
    Yin, Ling
    Sun, Shixin
    CEIS 2011, 2011, 15
  • [44] Dominating Sets and Connected Dominating Sets in Dynamic Graphs
    Hjuler, Niklas
    Italiano, Giuseppe F.
    Parotsidis, Nikos
    Saulpic, David
    36TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2019), 2019,
  • [45] NP-completeness results for partitioning a graph into total dominating sets
    Koivisto, Mikko
    Laakkonen, Petteri
    Lauri, Juho
    THEORETICAL COMPUTER SCIENCE, 2020, 818 : 22 - 31
  • [46] Strong vb-dominating and vb-independent sets of a graph
    Udupa, Sayinath
    Bhat, R. S.
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2020, 12 (01)
  • [47] NP-completeness Results for Partitioning a Graph into Total Dominating Sets
    Koivisto, Mikko
    Laakkonen, Petteri
    Lauri, Juho
    COMPUTING AND COMBINATORICS, COCOON 2017, 2017, 10392 : 333 - 345
  • [48] On 2-Resolving Hop Dominating Sets in the Join, Corona and Lexicographic Product of Graphs
    Mahistrado, Angelica Mae
    Rara, Helen
    EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2022, 15 (04): : 1982 - 1997
  • [49] Minimum Power Minimum D-Hop Dominating Sets in Wireless Sensor Networks
    Nguyen, Trac N.
    Huynh, Dung T.
    Bolla, Jason A.
    WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, PROCEEDINGS, 2008, 5258 : 176 - 187
  • [50] Distributed Construction of d-hop Connected Dominating Sets for Wireless Sensor Networks
    Skiadopoulos, Konstantinos
    Giannakis, Konstantinos
    Oikonomou, Konstantinos
    Stavrakakis, Ioannis
    Aissa, Sonia
    2018 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2018,
12345