A Note on the 2-Tuple Total Domination Problem in Harary Graphs

Si Han Yang; Hung Lung Wang

doi:10.1109/ICS.2016.0022

A Note on the 2-Tuple Total Domination Problem in Harary Graphs

Si Han Yang, Hung Lung Wang

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

4 Citations (Scopus)

Abstract

Let G be a graph with minimum degree at least 2. A vertex subset S is a 2-tuple total dominating set of G if every vertex is adjacent to at least two vertices in S. The 2-tuple total domination number of G is the minimum size of a 2-tuple total dominating set. In this paper, we are concerned with the 2-tuple total domination number of a Harary graph H_2m+1,2n+1 with 2n+1 = (2m+1)l. For m = 1 and m = 2, we show that the numbers are 2l and 2l+1, respectively.

Original language	English
Title of host publication	Proceedings - 2016 International Computer Symposium, ICS 2016
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	68-73
Number of pages	6
ISBN (Electronic)	9781509034383
DOIs	https://doi.org/10.1109/ICS.2016.0022
Publication status	Published - 2017 Feb 16
Externally published	Yes
Event	2016 International Computer Symposium, ICS 2016 - Chiayi, Taiwan Duration: 2016 Dec 15 → 2016 Dec 17

Publication series

Name	Proceedings - 2016 International Computer Symposium, ICS 2016

Conference

Conference	2016 International Computer Symposium, ICS 2016
Country/Territory	Taiwan
City	Chiayi
Period	2016/12/15 → 2016/12/17

Keywords

2-tuple total domination number
Harary graph

ASJC Scopus subject areas

Computer Vision and Pattern Recognition
Hardware and Architecture
Computer Networks and Communications
Computer Science Applications

Access to Document

10.1109/ICS.2016.0022

Cite this

A Note on the 2-Tuple Total Domination Problem in Harary Graphs. / Yang, Si Han; Wang, Hung Lung.
Proceedings - 2016 International Computer Symposium, ICS 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 68-73 7858444 (Proceedings - 2016 International Computer Symposium, ICS 2016).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Yang, SH & Wang, HL 2017, A Note on the 2-Tuple Total Domination Problem in Harary Graphs. in Proceedings - 2016 International Computer Symposium, ICS 2016., 7858444, Proceedings - 2016 International Computer Symposium, ICS 2016, Institute of Electrical and Electronics Engineers Inc., pp. 68-73, 2016 International Computer Symposium, ICS 2016, Chiayi, Taiwan, 2016/12/15. https://doi.org/10.1109/ICS.2016.0022

@inproceedings{9bb3fba349c94090b8042c85a8b5c26f,

title = "A Note on the 2-Tuple Total Domination Problem in Harary Graphs",

abstract = "Let G be a graph with minimum degree at least 2. A vertex subset S is a 2-tuple total dominating set of G if every vertex is adjacent to at least two vertices in S. The 2-tuple total domination number of G is the minimum size of a 2-tuple total dominating set. In this paper, we are concerned with the 2-tuple total domination number of a Harary graph H2m+1,2n+1 with 2n+1 = (2m+1)l. For m = 1 and m = 2, we show that the numbers are 2l and 2l+1, respectively.",

keywords = "2-tuple total domination number, Harary graph",

author = "Yang, {Si Han} and Wang, {Hung Lung}",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 2016 International Computer Symposium, ICS 2016 ; Conference date: 15-12-2016 Through 17-12-2016",

year = "2017",

month = feb,

day = "16",

doi = "10.1109/ICS.2016.0022",

language = "English",

series = "Proceedings - 2016 International Computer Symposium, ICS 2016",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "68--73",

booktitle = "Proceedings - 2016 International Computer Symposium, ICS 2016",

}

TY - GEN

T1 - A Note on the 2-Tuple Total Domination Problem in Harary Graphs

AU - Yang, Si Han

AU - Wang, Hung Lung

PY - 2017/2/16

Y1 - 2017/2/16

N2 - Let G be a graph with minimum degree at least 2. A vertex subset S is a 2-tuple total dominating set of G if every vertex is adjacent to at least two vertices in S. The 2-tuple total domination number of G is the minimum size of a 2-tuple total dominating set. In this paper, we are concerned with the 2-tuple total domination number of a Harary graph H2m+1,2n+1 with 2n+1 = (2m+1)l. For m = 1 and m = 2, we show that the numbers are 2l and 2l+1, respectively.

AB - Let G be a graph with minimum degree at least 2. A vertex subset S is a 2-tuple total dominating set of G if every vertex is adjacent to at least two vertices in S. The 2-tuple total domination number of G is the minimum size of a 2-tuple total dominating set. In this paper, we are concerned with the 2-tuple total domination number of a Harary graph H2m+1,2n+1 with 2n+1 = (2m+1)l. For m = 1 and m = 2, we show that the numbers are 2l and 2l+1, respectively.

KW - 2-tuple total domination number

KW - Harary graph

UR - http://www.scopus.com/inward/record.url?scp=85015328029&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015328029&partnerID=8YFLogxK

U2 - 10.1109/ICS.2016.0022

DO - 10.1109/ICS.2016.0022

M3 - Conference contribution

AN - SCOPUS:85015328029

T3 - Proceedings - 2016 International Computer Symposium, ICS 2016

SP - 68

EP - 73

BT - Proceedings - 2016 International Computer Symposium, ICS 2016

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2016 International Computer Symposium, ICS 2016

Y2 - 15 December 2016 through 17 December 2016

ER -

A Note on the 2-Tuple Total Domination Problem in Harary Graphs

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this