Geodetic global domination in corona and strong product of graphs

被引:2
|
作者
Xaviour, X. Lenin [1 ,2 ]
Chellathurai, S. Robinson [1 ]
机构
[1] Scott Christian Coll, Dept Math, Nagercoil 629003, Tamil Nadu, India
[2] Manonmaniam Sundaranar Univ, Tirunelveli 627012, Tamil Nadu, India
关键词
Geodetic set; dominating set; geodetic global domination; corona product; strong product;
D O I
10.1142/S1793830920500433
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A set S of vertices in a connected graph G = (V, E) is called a geodetic set if every vertex not in S lies on a shortest path between two vertices from S. A set D of vertices in G is called a dominating set of G if every vertex not in D has at least one neighbor in D. A set S is called a geodetic global dominating set of G if S is both geodetic and global dominating set of G. The geodetic global domination number is the minimum cardinality of a geodetic global dominating set in G. In this paper, we determine the geodetic global domination number of the corona and strong products of two graphs.
引用
收藏
页数:10
相关论文
共 50 条
  • [1] Geodetic Domination in the Corona and Join of Graphs
    Chellathurai, S. Robinson
    Vijaya, S. Padma
    [J]. Journal of Discrete Mathematical Sciences and Cryptography, 2014, 17 (01) : 81 - 90
  • [2] THE GEODETIC DOMINATION NUMBER FOR THE PRODUCT OF GRAPHS
    Chellathurai, S. Robinson
    Vijaya, S. Padma
    [J]. TRANSACTIONS ON COMBINATORICS, 2014, 3 (04) : 19 - 30
  • [3] GLOBAL LOCATION-DOMINATION IN THE LEXICOGRAPHIC PRODUCT AND CORONA OF GRAPHS
    Malnegro, Analen A.
    Malacas, Gina A.
    [J]. ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2019, 20 (01): : 61 - 71
  • [4] On the geodetic domination and domination numbers of some Cartesian product graphs
    Zhao, Min
    Wang, Qin
    [J]. ARS COMBINATORIA, 2019, 142 : 381 - 391
  • [5] On Strong Resolving Domination in the Join and Corona of Graphs
    Monsanto, Gerald B.
    Acal, Penelyn L.
    Rara, Helen M.
    [J]. EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2020, 13 (01): : 170 - 179
  • [6] ROMAN DOMINATION IN CARTESIAN PRODUCT GRAPHS AND STRONG PRODUCT GRAPHS
    Gonzalez Yero, Ismael
    Alberto Rodriguez-Velazquez, Juan
    [J]. APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS, 2013, 7 (02) : 262 - 274
  • [7] On the geodetic and the hull numbers in strong product graphs
    Caceres, J.
    Hernando, C.
    Mora, M.
    Pelayo, I. M.
    Puertas, M. L.
    [J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2010, 60 (11) : 3020 - 3031
  • [8] Strong geodetic cores and Cartesian product graphs
    Gledel, Valentin
    Irsic, Vesna
    Klavzar, Sandi
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2019, 363
  • [9] On the power domination number of corona product and join graphs
    Yuliana, I.
    Dafik
    Agustin, I. H.
    Wardani, D. A. R.
    [J]. 2ND INTERNATIONAL CONFERENCE OF COMBINATORICS, GRAPH THEORY, AND NETWORK TOPOLOGY, 2019,
  • [10] On the power domination number of corona product and join graphs
    Yuliana, I.
    Dafik
    Agustin, I.H.
    Wardani, D.A.R.
    [J]. Journal of Physics: Conference Series, 2019, 1211 (01):