MINIMUM DOMINATING SET FOR THE PRISM GRAPH FAMILY

被引:0
|
作者
Esther, Jebisha S. [1 ]
Vivik, Veninstine J. [1 ]
机构
[1] Karunya Inst Technol & Sci, Dept Math, Coimbatore 641114, Tamil Nadu, India
来源
关键词
Minimal dominating set; domination number; prism; antiprism; NUMBER;
D O I
10.5206/mase/15775
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The dominating set of the graph G is a subset D of vertex set V, such that every vertex not in V - D is adjacent to at least one vertex in the vertex subset D. A dominating set D is a minimal dominating set if no proper subset of D is a dominating set. The number of elements in such set is called as domination number of graph and is denoted by gamma(G). In this work the domination numbers are obtained for family of prism graphs such as prism CLn, antiprism Q(n) and crossed prism R-n by identifying one of their minimum dominating set.
引用
收藏
页码:30 / 39
页数:10
相关论文
共 50 条
  • [31] MAKING A DOMINATING SET OF A GRAPH CONNECTED
    Li, Hengzhe
    Wu, Baoyindureng
    Yang, Weihua
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (04) : 947 - 962
  • [32] Partitioning the vertices of a graph or its complement into a total dominating set and an independent dominating set
    Haynes, Teresa w.
    Henning, Michael a.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2024, 89 : 97 - 115
  • [33] Minimum dominating maximum degree energy of a graph
    Jagadeesh R.
    Kanna M.R.R.
    Mamta D.
    Kumar R.P.
    Journal of Computational and Theoretical Nanoscience, 2016, 13 (05) : 2850 - 2855
  • [34] RECONFIGURING MINIMUM DOMINATING SETS: THE γ-GRAPH OF A TREE
    Edwards, Michelle
    MacGillivray, Gary
    Nasserasr, Shahla
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (03) : 703 - 716
  • [35] Remarks on the Energy and the Minimum Dominating Energy of a Graph
    Milovanovic, Igor Z.
    Milovanovic, Emina I.
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2016, 75 (02) : 305 - 314
  • [36] MINIMUM ROMAN DOMINATING DISTANCE ENERGY OF A GRAPH
    Lakshmanan, R.
    Annamalai, N.
    JOURNAL OF THE INDONESIAN MATHEMATICAL SOCIETY, 2023, 29 (03) : 338 - 346
  • [37] A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph
    Panda, B. S.
    Pradhan, D.
    DISCRETE APPLIED MATHEMATICS, 2013, 161 (12) : 1776 - 1783
  • [38] A linear-time algorithm for minimum k-hop dominating set of a cactus graph
    Abu-Affash, A. Karim
    Carmi, Paz
    Krasin, Adi
    DISCRETE APPLIED MATHEMATICS, 2022, 320 : 488 - 499
  • [39] Maximum graphs with a unique minimum dominating set
    Fischermann, M
    Rautenbach, D
    Volkmann, L
    DISCRETE MATHEMATICS, 2003, 260 (1-3) : 197 - 203
  • [40] Statistical Mechanics of the Minimum Dominating Set Problem
    Zhao, Jin-Hua
    Habibulla, Yusupjan
    Zhou, Hai-Jun
    JOURNAL OF STATISTICAL PHYSICS, 2015, 159 (05) : 1154 - 1174