臺灣博碩士論文加值系統

本論文的主旨是利用三種不同的方法來證明兩個已經給定的著色確實都是IC著色。我們將使用數學歸納法，二進位表示法以及整數分割法來證明當n>=2時，已經給定著色的完全二分圖K(2,n)確實是IC著色。

The purpose of this dissertation is to give three different proofs for given colorings to be IC-colorings. We shall use induction, a binary representation and an integer partition to prove given colorings of a complete bipartitle graph K(2,n), with n>=2, to be IC-colorings.

中文摘要........................................I
Abstract......................................II
謝誌..........................................III
Contents......................................IV
1、Basic Definitions and Notations.............1
2、An Induction Proof..........................3
3、A Binary representation Proof..............10
4、An integer Partition Proof.................14
References....................................20

[1] E.Salehi, S. Lee and M. Khatirinejad, IC-colorings and IC-Indices of graphs, Discrete Matematics, 2009(2005), pp. 297-310.

[2] C.L. Shiue and H.L.Fu, The IC-Indices of complete bipartitle graphs, Electronic J. of Combinatorics, 15(2008), #R43