GRAPHS WHOSE VERTEX SET CAN BE PARTITIONED INTO A TOTAL DOMINATING SET AND AN INDEPENDENT DOMINATING SET

被引:0
|
作者
Haynes, Teresa W. [1 ]
Henning, Michael A. [2 ]
机构
[1] East Tennessee State Univ, Dept Math & Stat, Johnson City, TN 37614 USA
[2] Univ Johannesburg, Dept Math & Appl Math, ZA-2006 Auckland Pk, South Africa
基金
新加坡国家研究基金会;
关键词
total domination; vertex partitions; independent domination; VERTICES;
D O I
10.7494/OpMath.2024.44.4.543
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A graph G whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. We give constructions that yield infinite families of graphs that are TI-graphs, as well as constructions that yield infinite families of graphs that are not TI-graphs. We study regular graphs that are TI-graphs. Among other results, we prove that all toroidal graphs are TI-graphs.
引用
收藏
页码:543 / 563
页数:21
相关论文
共 50 条
  • [1] A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
    Haynes, Teresa W.
    Henning, Michael A.
    DISCRETE APPLIED MATHEMATICS, 2024, 358 : 457 - 467
  • [2] Partitioning the Vertices of a Graph into a Total Dominating Set and an Independent Dominating Set
    Delgado, Pamela
    Desormeaux, Wyatt J.
    Haynes, Teresa W.
    ARS COMBINATORIA, 2019, 144 : 367 - 379
  • [3] 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
  • [4] An independent dominating set in the complement of a minimum dominating set of a tree
    Henning, Michael A.
    Loewenstein, Christian
    Rautenbach, Dieter
    APPLIED MATHEMATICS LETTERS, 2010, 23 (01) : 79 - 81
  • [5] On the complexity of independent dominating set with obligations in graphs
    Laforest, Christian
    Martinod, Timothee
    THEORETICAL COMPUTER SCIENCE, 2022, 904 : 1 - 14
  • [6] INDEPENDENT SET DOMINATING SETS IN BIPARTITE GRAPHS
    Zelinka, Bohdan
    OPUSCULA MATHEMATICA, 2005, 25 (02) : 345 - 349
  • [7] On resolving total dominating set of sunlet graphs
    Ervani, R. S. R.
    Dafik
    Tirta, I. M.
    Alfarisi, R.
    Adawiyah, R.
    2ND INTERNATIONAL CONFERENCE ON PHYSICS AND MATHEMATICS FOR BIOLOGICAL SCIENCE (2ND ICOPAMBS) 2020, 2021, 1832
  • [8] Independent point-set dominating sets in graphs
    Gupta, Purnima
    Goyal, Alka
    Jain, Ranjana
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020, 17 (01) : 229 - 241
  • [9] On the independent dominating set polytope
    Mahjoub, AR
    Mailfert, J
    EUROPEAN JOURNAL OF COMBINATORICS, 2006, 27 (04) : 601 - 616
  • [10] Approximating the minimum independent dominating set in perturbed graphs
    Tong, Weitian
    Goebel, Randy
    Lin, Guohui
    THEORETICAL COMPUTER SCIENCE, 2014, 554 : 275 - 282