Browse > Article
http://dx.doi.org/10.6109/jkiice.2016.20.12.2243

Analysis on the characteristics for upper bound of [1,2]-domination in trees  

Lee, Hoon (Department of Information & Communications Engineering, Changwon National University)
Sohn, Moo Young (Department of Mathematics, Changwon National University)
Abstract
In this paper, we propose a theoretical model for characterization and upper bounds of [1,2]-domination set of network which has tree structure. In detail, we propose a theoretic model for upper bounds on [1,2]-domination set of a tree network which has some typical constrains. To that purpose, we introduce a graph theory to model and analyze the characteristics of tree structure networks. We assume a node subset D of a graph G=(V,E). We define that D is a [1,2]-dominant set if for any node v in set V which is not an element of a set D is adjacent to a node or two nodes of an element in a set D (that is, $1{\leq}{\mid}N({\upsilon}){\bigcap}D{\mid}{\leq}2$ for every node $v{\in}V-D$). The minimum cardinality of a [1,2]-dominating set of G, which is denoted by ${\gamma}_{[1,2]}(G)$, is called the [1,2]-domination number of G. In this paper, we show new upper bounds and characteristics about the [1,2]-domination number of tree.
Keywords
Graph; Tree; Domination Number; [1,2]-Domination Number; Upper Bound;
Citations & Related Records
연도 인용수 순위
  • Reference
1 H. Kim, Internet of Things, Hong-Leung Publishing Co., Seoul, Korea, 2014.
2 H. Lee, Internetworkology, Hong-Leung Publishing Co., Seoul, Korea, 2013.
3 M. Chellali, T.W. Haynes, S. T. Hedetniemi, "[1,2]-sets in graphs," Discrete Applied Mathematics, vol. 161, no. 18, pp 2885-2893, Dec. 2013.   DOI
4 X. J. Yang, B. Wu, "[1,2]-domination in graphs," Discrete Applied Mathematics, vol. 175, no. 1, pp 79-86, Jan. 2014.   DOI
5 D. B. West, Introduction to graph theory, second ed., Prentice Hall, Upper Saddle River, NJ, 2001.
6 T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.