Geodetic Hop Dominating Sets in a Graph

被引：3

作者：

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 条

[31] CONNECTED PERFECT HOP DOMINATING SETS UNDER SOME BINARY OPERATIONS
Rakim, Raicah C.
Rara, Helen M.
Pabilona, Yamilita M.
ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2019, 20 (01): : 111 - 132
[32] Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration
Couturier, Jean-Francois
Heggernes, Pinar
van't Hof, Pim
Kratsch, Dieter
SOFSEM 2012: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2012, 7147 : 202 - +
[33] Minimal dominating sets in graph classes: Combinatorial bounds and enumeration
Couturier, Jean-Francois
Heggernes, Pinar
van 't Hof, Pim
Kratsch, Dieter
THEORETICAL COMPUTER SCIENCE, 2013, 487 : 82 - 94
[34] Reconfiguring Dominating Sets in Minor-Closed Graph Classes
Dieter Rautenbach
Johannes Redl
Graphs and Combinatorics, 2021, 37 : 2191 - 2205
[35] CONDITIONAL GRAPH-THEORY .4. DOMINATING SETS
HARARY, F
HAYNES, TW
UTILITAS MATHEMATICA, 1995, 48 : 179 - 192
[36] Reconfiguring Dominating Sets in Minor-Closed Graph Classes
Rautenbach, Dieter
Redl, Johannes
GRAPHS AND COMBINATORICS, 2021, 37 (06) : 2191 - 2205
[37] A tight upper bound on the average order of dominating sets of a graph
Beaton, Iain
Cameron, Ben
JOURNAL OF GRAPH THEORY, 2024, : 463 - 477
[38] Partitioning the vertices of a cubic graph into two total dominating sets
Desormeaux, Wyatt J.
Haynes, Teresa W.
Henning, Michael A.
DISCRETE APPLIED MATHEMATICS, 2017, 223 : 52 - 63
[39] Monitoring edge-geodetic sets: Hardness and graph products
Haslegrave, John
DISCRETE APPLIED MATHEMATICS, 2023, 340 : 79 - 84
[40] 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

← 1 2 3 4 5 →