| 陈祥恩,李婷,王治文.一类含有4-圈的单圈图一般点可区别全染色[J].,2017,57(3):316-320 |
| 一类含有4-圈的单圈图一般点可区别全染色 |
| General vertex-distinguishing total colorings of a family of unicyclic graphs including C 4 |
| |
| DOI：10.7511/dllgxb201703015 |
| 中文关键词: 单圈图 一般全染色 一般点可区别全染色 一般点可区别全色数 |
| 英文关键词: unicyclic graphs general total coloring general vertex-distinguishing total coloring general vertex-distinguishing total chromatic number |
| 基金项目:国家自然科学基金资助项目(611630376116305411261046)；宁夏回族自治区百人计划资助项目. |
|
| 摘要点击次数: 1057 |
| 全文下载次数: 1044 |
| 中文摘要: |
| 设G为简单图．设f是图G的一个一般全染色，若对图G的任意两个不同的顶点u、v，有C(u)≠C(v)，则称f为图G的一般点可区别全染色(简记为 GVDTC )．对图G进行一般点可区别全染色所需要的最少颜色数称为图G的一般点可区别全色数．将一类含有4-圈的单圈图悬挂边的染色按从小到大的顺序排列，探讨了它的一般点可区别全染色，确定了它具有一般点可区别全染色，并得到了它的一般点可区别全色数． |
| 英文摘要: |
| Let G be a simple graph. For a general total coloring f of G , if C(u)≠C(v) for any two different vertices u and v of G , then f is called a general vertex-distinguishing total coloring of G (or GVDTC of G for short). The minimum number of colors required in a GVDTC is the general vertex-distinguishing total chromatic number. The general vertex-distinguishing total colorings of a family of unicyclic graphs including C 4 are discussed by making the coloring of its pendent edges in an ascending order. It is determined that it has a general vertex-distinguishing total coloring of G and its general vertex-distinguishing total chromatic number is got. |
|
查看全文
查看/发表评论 下载PDF阅读器 |
| 关闭 |