TY - GEN
T1 - A Note on the 2-Tuple Total Domination Problem in Harary Graphs
AU - Yang, Si Han
AU - Wang, Hung Lung
N1 - Publisher Copyright:
© 2016 IEEE.
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 - https://www.scopus.com/pages/publications/85015328029
UR - https://www.scopus.com/pages/publications/85015328029#tab=citedBy
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 -