天津科技大学学报2011，Vol.26Issue(1)：75-78,4.
点可区别边色数和点可区别全色数的两个上界
Two Upper Bounds for the Vertex-Distinguishing-Edge Chromatic Numbers and Vertex-Distinguishing-Total Chromatic Numbers
摘要
Abstract
It was proved that every graph with n vertices and with maximum degree Δ≥2 has a vertex distinguishing edge coloring with at most nΔ(n-1) colors by using the first moment principle and Markov's inequality of probabilistic method. It was also proved that every graph with n≥3 vertices and with maximum degree Δ≥1 has a vertex distinguishing total coloring with at most 2nΔ(n-1) colors.关键词
边染色/全染色/点可区别边色数/点可区别全色数/概率方法分类
数理科学引用本文复制引用
安明强,孟祥波..点可区别边色数和点可区别全色数的两个上界[J].天津科技大学学报,2011,26(1):75-78,4.基金项目
天津科技大学科学研究基金资助项目(20090222) （20090222）
