Distance-two domination of graphs

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：2

、訪客IP：18.220.13.70

姓名

許豐如(Feng-Ru Hsu) 查詢紙本館藏

畢業系所

數學系

論文名稱

(Distance-two domination of graphs)

相關論文

★ Signed Domination in Block Graphs	★ Wide diameters and Rabin numbers of generalized folded hypercube networks
★ Strong Rabin Numbers on Cartesian Products of Graphs	★ Global defensive alliances in double-loop networks
★ 雙環網路距離二以內的控制問題	★ 廣義彼得森圖形的控制數

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

由於實際資源分享的問題，我們在此篇論文裡面考量到控制問題的變形，稱為距離二以內的控制問題。
這篇論文的架構如下。第一節、介紹基本的定義。第二節、研究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.

關鍵字(中)

關鍵字(英)

★ NP complete
★ domination

論文目次

1Introduction ....................1
2 Distance-two domination of paths and cycles ....................5
3 NP-Complete result ....................7
4 Distance-two domination of fully binary tree ....................11
References ....................15

參考文獻

References
[1] A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Desing and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA (1974).
[2] G. J. Chang, Algorithmic Aspects of Domination in Graphs, Handbook of Com-binatorial Optimization (D. Z. Du and P. M. Pardalos edited) Vol. 3 (1998),339-405.
[3] T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Domination in Graphs: Ad-vanced Topics, Marcel Dekker, NY (1998).
[4] T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, NY (1998).
[5] E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, Rockville, MD (1978).
[6] U. Manber, Introduction to Algorithms, Addison-Wesley, Reading, MA (1989).
[7] D. B. West, Introduction to Graph Theory, 2nd ed., Prentice-Hall, NJ (2001).

指導教授

廖勝強(Sheng-Chyang Liaw)

審核日期

2006-6-23

推文