Determining the 2-Tuple Total Domination Number of a Harary Graph under Specific Degree Conditions

Min Shu Jao; Hung Lung Wang; Jou Ming Chang; Chia Wen Wu

doi:10.6688/JISE.202403_40(2).0004

Determining the 2-Tuple Total Domination Number of a Harary Graph under Specific Degree Conditions

Min Shu Jao
, Hung Lung Wang^*
, Jou Ming Chang
, Chia Wen Wu

^*Corresponding author for this work

Department of Computer Science and Information Engineering

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

Abstract

Given a graph G, a 2-tuple total dominating set is a vertex subset S such that every vertex has at least two neighbors in S. The cardinality of a minimum 2-tuple total dominating set is called the 2-tuple total domination number. In this paper, we determine the 2-tuple total domination numbers of H_m,n for m ∈ {3, 5}, where H_m,n stands for a Harary graph of n vertices with degree parameter m.

Original language	English
Pages (from-to)	253-264
Number of pages	12
Journal	Journal of Information Science and Engineering
Volume	40
Issue number	2
DOIs	https://doi.org/10.6688/JISE.202403_40(2).0004
Publication status	Published - 2024 Mar

Keywords

2-tuple total domination
domination
graph theory
Harary graphs
regular graphs

ASJC Scopus subject areas

Software
Human-Computer Interaction
Hardware and Architecture
Library and Information Sciences
Computational Theory and Mathematics

Access to Document

10.6688/JISE.202403_40(2).0004

Cite this

@article{46c6e7e9e3c748de87e6c6fafcc2dbc2,

title = "Determining the 2-Tuple Total Domination Number of a Harary Graph under Specific Degree Conditions",

abstract = "Given a graph G, a 2-tuple total dominating set is a vertex subset S such that every vertex has at least two neighbors in S. The cardinality of a minimum 2-tuple total dominating set is called the 2-tuple total domination number. In this paper, we determine the 2-tuple total domination numbers of Hm,n for m ∈ \{3, 5\}, where Hm,n stands for a Harary graph of n vertices with degree parameter m.",

keywords = "2-tuple total domination, domination, graph theory, Harary graphs, regular graphs",

author = "Jao, \{Min Shu\} and Wang, \{Hung Lung\} and Chang, \{Jou Ming\} and Wu, \{Chia Wen\}",

year = "2024",

month = mar,

doi = "10.6688/JISE.202403\_40(2).0004",

language = "English",

volume = "40",

pages = "253--264",

journal = "Journal of Information Science and Engineering",

issn = "1016-2364",

publisher = "Institute of Information Science",

number = "2",

}

TY - JOUR

T1 - Determining the 2-Tuple Total Domination Number of a Harary Graph under Specific Degree Conditions

AU - Jao, Min Shu

AU - Wang, Hung Lung

AU - Chang, Jou Ming

AU - Wu, Chia Wen

PY - 2024/3

Y1 - 2024/3

N2 - Given a graph G, a 2-tuple total dominating set is a vertex subset S such that every vertex has at least two neighbors in S. The cardinality of a minimum 2-tuple total dominating set is called the 2-tuple total domination number. In this paper, we determine the 2-tuple total domination numbers of Hm,n for m ∈ {3, 5}, where Hm,n stands for a Harary graph of n vertices with degree parameter m.

AB - Given a graph G, a 2-tuple total dominating set is a vertex subset S such that every vertex has at least two neighbors in S. The cardinality of a minimum 2-tuple total dominating set is called the 2-tuple total domination number. In this paper, we determine the 2-tuple total domination numbers of Hm,n for m ∈ {3, 5}, where Hm,n stands for a Harary graph of n vertices with degree parameter m.

KW - 2-tuple total domination

KW - domination

KW - graph theory

KW - Harary graphs

KW - regular graphs

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

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

U2 - 10.6688/JISE.202403_40(2).0004

DO - 10.6688/JISE.202403_40(2).0004

M3 - Editorial

AN - SCOPUS:85188153328

SN - 1016-2364

VL - 40

SP - 253

EP - 264

JO - Journal of Information Science and Engineering

JF - Journal of Information Science and Engineering

IS - 2

ER -

Determining the 2-Tuple Total Domination Number of a Harary Graph under Specific Degree Conditions

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this