IC-Colorings of the Join and the Combination of graphs
碩士 === 大同大學 === 應用數學學系(所) === 95 === Let G=(V,E) be a graph and f:V-N be a function. For any subgraph H of G, define f(H)=sum f(v).In particular, we denote f(G)by S(f). The function f is called an IC-coloring if for any integer k[1,S(f)] there is a connected subgraph H of G such that f(H)=k. Also,we...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/y3q7gt |