Disjoint total dominating sets in near-triangulations

P. Francis; Abraham M. Illickan; Lijo M. Jose; Deepak Rajendraprasad

doi:10.1002/jgt.23014

Disjoint total dominating sets in near-triangulations

P. Francis
, Abraham M. Illickan
, Lijo M. Jose^*
, Deepak Rajendraprasad

^*Corresponding author for this work

School of Computer Engineering

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

Abstract

We show that every simple planar near-triangulation with minimum degree at least three contains two disjoint total dominating sets. The class includes all simple planar triangulations other than the triangle. This affirms a conjecture of Goddard and Henning.

Original language	English
Pages (from-to)	68-77
Number of pages	10
Journal	Journal of Graph Theory
Volume	105
Issue number	1
DOIs	https://doi.org/10.1002/jgt.23014
Publication status	Published - 01-2024

All Science Journal Classification (ASJC) codes

Geometry and Topology
Discrete Mathematics and Combinatorics

Access to Document

10.1002/jgt.23014

Cite this

@article{6498c2b394c844d8b2d75fe3776e949f,

title = "Disjoint total dominating sets in near-triangulations",

abstract = "We show that every simple planar near-triangulation with minimum degree at least three contains two disjoint total dominating sets. The class includes all simple planar triangulations other than the triangle. This affirms a conjecture of Goddard and Henning.",

author = "P. Francis and Illickan, \{Abraham M.\} and Jose, \{Lijo M.\} and Deepak Rajendraprasad",

note = "Publisher Copyright: {\textcopyright} 2023 Wiley Periodicals LLC.",

year = "2024",

month = jan,

doi = "10.1002/jgt.23014",

language = "English",

volume = "105",

pages = "68--77",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "Wiley-Liss Inc.",

number = "1",

}

TY - JOUR

T1 - Disjoint total dominating sets in near-triangulations

AU - Francis, P.

AU - Illickan, Abraham M.

AU - Jose, Lijo M.

AU - Rajendraprasad, Deepak

PY - 2024/1

Y1 - 2024/1

N2 - We show that every simple planar near-triangulation with minimum degree at least three contains two disjoint total dominating sets. The class includes all simple planar triangulations other than the triangle. This affirms a conjecture of Goddard and Henning.

AB - We show that every simple planar near-triangulation with minimum degree at least three contains two disjoint total dominating sets. The class includes all simple planar triangulations other than the triangle. This affirms a conjecture of Goddard and Henning.

UR - https://www.scopus.com/pages/publications/85166522977

UR - https://www.scopus.com/pages/publications/85166522977#tab=citedBy

U2 - 10.1002/jgt.23014

DO - 10.1002/jgt.23014

M3 - Article

AN - SCOPUS:85166522977

SN - 0364-9024

VL - 105

SP - 68

EP - 77

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 1

ER -

Disjoint total dominating sets in near-triangulations

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this