Rainbow Domination in Generalized de Bruijn Digraphs
碩士 === 國立臺灣科技大學 === 資訊管理系 === 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)) =...
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 |
Similar Items
-
Double Eulerian cycles on de Bruijn digraphs
by: Krahn, Gary William
Published: (2014) -
On kernels by rainbow paths in arc-coloured digraphs
by: Li Ruijuan, et al.
Published: (2021-05-01) -
Rainbow Connectivity of Cacti and of Some Infinite Digraphs
by: Alva-Samos Jesús, et al.
Published: (2017-05-01) -
The k-Rainbow Bondage Number of a Digraph
by: Amjadi Jafar, et al.
Published: (2015-05-01) -
A Note on Roman Domination of Digraphs
by: Chen Xiaodan, et al.
Published: (2019-02-01)