Upper Bounds on k-rainbow Domination Number of Sierpiński Graphs

碩士 === 明志科技大學 === 工業工程與管理系碩士班 === 102 === The k-rainbow domination is a variant of the classical domination problem in graphs and is defined as follows. Given an undirected graph G = (V, E), we have a set C with k colors and assign an arbitrary subset of these colors to each vertex of G. If a vertex...

Full description

Bibliographic Details
Main Authors: Ting-Wei Liu, 劉庭崴
Other Authors: Kung-Jui Pai
Format: Others
Language:zh-TW
Published: 2014
Online Access:http://ndltd.ncl.edu.tw/handle/edz49c