Distance-two domination of graphs

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/7901

Title:	Distance-two domination of graphs
Authors:	許豐如;Feng-Ru Hsu
Contributors:	數學研究所
Keywords:	NP complete;domination
Date:	2006-06-21
Issue Date:	2009-09-22 11:08:34 (UTC+8)
Publisher:	國立中央大學圖書館
Abstract:	由於實際資源分享的問題，我們在此篇論文裡面考量到控制問題的變形，稱為距離二以內的控制問題。這篇論文的架構如下。第一節、介紹基本的定義。第二節、研究paths 和cycles之距離二以內的控制。第三節、證明D_{3,2,1}控制問題為NP-complete在二分圖上。第四節、決定fully binary tree 之D_{3,2,1}控制數。 Due to a practical resource sharing problem, we consider a variation of the domination problem in this thesis which we call the distance-two domination problem. This thesis is organized as follows. Section 1 gives basic definitions and notation. Section 2 investigates the distance-two domination of paths and cycles. Section 3 shows that D_{3,2,1}-domination problem is NP-complete for bipartite graphs. And we determine the D_{3,2,1}-domination number of fully binary tree in the final section.
Appears in Collections:	[Graduate Institute of Mathematics] Electronic Thesis & Dissertation

Files in This Item:

File	Size	Format

社群 sharing