Rainbow Domination in Generalized de Bruijn Digraphs

• Main Authors: Meng-Hao Ko, 柯孟豪
• Other Authors: Yue-Li Wang
• Format: Others
• Language: en_US
• Published: 2014
• Online Access: http://ndltd.ncl.edu.tw/handle/10251529755844527977

碩士 === 國立臺灣科技大學 === 資訊管理系 === 102 === In this thesis, we are concerned with the k-rainbow domination problem on generalized de Bruijn digraphs. We give an upper bound and a lower bound for the k-rainbow domination number in generalized de Bruijn digraphs GB(n; d). We show that \gamma rk(GB(n, d)) = k if and only if \alpha ≤ 1, where n = d + \alpha and rk(GB(n, d)) is the k-rainbow domination number of GB(n, d). We also discuss the class of generalized de Bruijn digraphs with \gamma rk(GB(n, d)) ≤ k⌈ n/(d+1)⌉.