Using repeat-number to estimate the upper bound of IC-index on paths
碩士 === 國立東華大學 === 應用數學系 === 103 === Let G be a graph and f : V (G) → N be a coloring on G. Define f(G)=∑_(x∈V(G))f(x).Suppose for all α∈{1,2,...,f(G)} there is a connected subgraph H of G, that ∑_(x∈V(H))f(x)=α , then f is said to be an IC-coloring of G.And the IC-index M(G) is defined as M(G) = m...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/05613695179027129524 |