透過您的圖書館登入
IP:3.144.84.155
  • 學位論文

一些圖之控制數的研究

A Study of the domination number of graphs

指導教授 : 高金美

摘要


在此論文中,我們先由已知的路徑圖與迴圈圖的控制數,去獲得兩個圖的聯集的控制數與原來各自圖的控制數的關係,即何時 γ(P_n∪P_m )=γ(P_n )+γ(P_m )?何時 γ(P_n∪C_m )=γ(P_n )+γ(C_m )? 再從圖 P_n □ P_m 控制數的探討延伸至圖 P_n □ C_m,由兩種圖的差異性得到以下結果 結果請詳見紙本與電子論文

關鍵字

控制數 k-控制數

並列摘要


In this thesis we start from the domination numbers of paths and cycles, to obtain that when can we get γ(P_n∪P_m )=γ(P_n )+γ(P_m ) and γ(P_n∪C_m )=γ(P_n )+γ(C_m ) respectively. Next, we get the relationship between the domination number of P_n □ P_m and P_n □ C_m as follows: Last part we obtain that the k-domination number of P_n □ C_m as follows Please see the thesis and electronic thesis for the results

參考文獻


[1] B. Brešar , M.A. Henning, S. Klavžar, On integer domination in graphs and vizing-like problems, Taiwan J. Math. 10.5 (2006), 1317-1328.
[2] G. Chartrand and P. Zhang, Introduction to Graph Theory, McGraw-Hill, Boston, Mass, USA, 2005.
[3] G. Chen, W. Piotrowski, W. Shreve A partition approach to Vizing’s conjecture, J. Graph Theory 21(1996), 103-111.
[4] W.E. Clark, S. Suen, An inequality related to Vizing's conjecture, the electronic journal of combinatorics, 7.1 (2000) Note4, 3 pp.(electronic)
[5] G. Domke, S.T. Hedetniemi, R.C. Laskar, G. Fricke, Relationships between integer and fractional parameters of graphs, in: Graph Theory, Combinatorics, and Applications vol. 2, John Wiley & Sons, Inc., 1991, pp. 371-387.

延伸閱讀


國際替代計量