A Study of the Bounds of Point Distinguish Chromatic Indices
碩士 === 大同大學 === 應用數學研究所 === 90 === The point-distinguishing chromatic index of a graph $G=(V,E)$ is the smallest number of colors assigned to $E$ so that no two distinct points are incident with the same color set. In this thesis we discuss the bounds of the point-distinguishing chromatic...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/91695510887825793257 |
| Summary: | 碩士 === 大同大學 === 應用數學研究所 === 90 === The point-distinguishing chromatic index of a graph $G=(V,E)$ is the smallest number of colors assigned to $E$ so that no two distinct points are incident with the same color set. In this thesis we discuss the bounds of the point-distinguishing chromatic indices of graphs obtained by the graph operations. We emphasize that these bounds are all best possible or attainable. And we discuss the bounds of the point-distinguishing chromatic indices of some specific graphs.
|
|---|