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
来源：
MATHEMATICS IN APPLIED SCIENCES AND ENGINEERING | 2023年 / 4卷 / 01期
关键词：
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 条
  • [21] Approximating a Minimum Dominating Set by Purification
    Inza, Ernesto Parra
    Vakhania, Nodari
    Almira, Jose Maria Sigarreta
    Hernandez-Aguilar, Jose Alberto
    ALGORITHMS, 2024, 17 (06)
  • [22] ON APPROXIMATING THE MINIMUM INDEPENDENT DOMINATING SET
    IRVING, RW
    INFORMATION PROCESSING LETTERS, 1991, 37 (04) : 197 - 200
  • [23] Applying Genetic Algorithms to Validate a Conjecture in Graph Theory: The Minimum Dominating Set Problem
    Cervantes-Ojeda, Jorge
    Gomez-Fuentes, Maria C.
    Fresan-Figueroa, Julian A.
    ADVANCES IN COMPUTATIONAL INTELLIGENCE, MICAI 2023, PT I, 2024, 14391 : 271 - 282
  • [24] ON FINDING A MINIMUM DOMINATING SET IN A TOURNAMENT
    MEGIDDO, N
    VISHKIN, U
    THEORETICAL COMPUTER SCIENCE, 1988, 61 (2-3) : 307 - 316
  • [25] Finding minimum weight connected dominating set in stochastic graph based on learning automata
    Torkestani, Javad Akbari
    Meybodi, Mohammad Reza
    INFORMATION SCIENCES, 2012, 200 : 57 - 77
  • [26] Construction of minimum edge-fault tolerant connected dominating set in a general graph
    Yaoyao Zhang
    Zhao Zhang
    Ding-Zhu Du
    Journal of Combinatorial Optimization, 2023, 45
  • [27] Construction of minimum edge-fault tolerant connected dominating set in a general graph
    Zhang, Yaoyao
    Zhang, Zhao
    Du, Ding-Zhu
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2023, 45 (02)
  • [28] Applying Genetic Algorithms to Validate a Conjecture in Graph Theory: The Minimum Dominating Set Problem
    Cervantes-Ojeda, Jorge
    Gomez-Fuentes, Maria C.
    Fresan-Figueroa, Julian A.
    COMPUTACION Y SISTEMAS, 2023, 27 (04): : 1089 - 1097
  • [29] Construction of Multiplicative Graph Spanners using Minimum Connected Dominating Set with Bounded Diameter
    Tatikonda, Praneeth
    Kuppili, Harsha
    Paila, Avinash
    Pai, Jayakumar
    Nair, Jyothisha J.
    2018 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2018, : 1436 - 1440
  • [30] A 5+ε-approximation algorithm for minimum weighted dominating set in unit disk graph
    Dai, Decheng
    Yu, Changyuan
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (8-10) : 756 - 765
12345