 |
 |
Recent數據載入中... |
【應數系演講-100-05-20】The F-domination Problem of Graphs
國立東華大學應用數學系
專 題 演 講
主講人：張展維博士候選人
國立東華大學應用數學系
講 題：The F-domination Problem of Graphs 時 間：100年5月20日(星期五)15:10-16:10
摘 要
Given a graph and a set , a vertex is said to be F-dominated by a vertex in if either, or and there exists a vertex in such that is a path in A set is an -dominating set of if every vertex is -dominated by a vertex in The -domination number of , denoted by , is the minimum cardinality of an -dominating set of . We consider the -domination problem of graphs in this Ph.D. thesis. We prove that the -domination problem is an NP-complete problem and give formulas to compute the -domination number of and for special
上列演講地點於理學院A324會議室舉行
※※※ 歡 迎 參 加 ※※※se1000520
附件：
瀏覽數
|