| Summary: | 碩士 === 中原大學 === 應用數學研究所 === 97 === We extend the idea of stamp problem to IC-coloring and study it. Let G be a connected graph and let . For each connected subgraph H of G; we define . If for each integer , there is a connected subgraph H of G such that , then f is called an IC-coloring of G. The IC-index of a graph G, denoted by M(G), is defined to be M(G) : f is an IC-coloring of G }. We say f is a maximal IC-coloring of G if f is an IC-coloring of G with . In this thesis, we find the lower bounds of the IC-index of K(1,1,n) and then prove that the IC-index of K(1,1,n) is .
|
|---|
