首页 | 本学科首页   官方微博 | 高级检索  
     检索      

轮与路的多重联图的邻点可区别E-全染色
引用本文:张威,张荔,李沐春.轮与路的多重联图的邻点可区别E-全染色[J].数学的实践与认识,2012,42(10):128-132.
作者姓名:张威  张荔  李沐春
作者单位:1. 华南师范大学物理与电信工程学院,广东广州,510006
2. 兰州交通大学数理与软件工程学院,兰州甘肃,730070
基金项目:国家自然科学基金,甘肃省硕导基金
摘    要:G(V,E)是一个简单图,k是一个正整数,f是一个V(G)∪E(G)到{1,2,…,k}的映射.如果(V)u,v∈V(G),则f(u)≠f(v),f(u)≠f(uv),f(v)≠f(uv),C(u)≠C(v),称f是图G的邻点可区别E-全染色,称最小的数k为图G的邻点可区别E-全色数.给出了轮与路间的多重联图的邻点可区别E-全色数,其中C(u)={f(u)}∪ {f(uv)|uv∈E(G)}.

关 键 词:多重联图  邻点可区别E-全染色  邻点可区别E-全色效

Adjacent Vertex-Distinguishing E-Total Coloring on the Multiple Join Graph of Wheel and Path
ZHANG Wei , ZHANG Li , LI Mu-chun.Adjacent Vertex-Distinguishing E-Total Coloring on the Multiple Join Graph of Wheel and Path[J].Mathematics in Practice and Theory,2012,42(10):128-132.
Authors:ZHANG Wei  ZHANG Li  LI Mu-chun
Institution:1.College of Physics and Telecommunication Engineering,South China Normal University,Guangzhou 510006, China) (2.College of Mathematics,Physics and Software Engineering,Lanzhou Jiaotong University,Lanzhou 730070, China)
Abstract:Let G(V,E) be a simple graph,k be a positive integer,f be a mapping from V(G)∪E(G) to {1,2,…,k}.If∨uv∈E(G),we have f(u)≠f(u),f(u)≠f(uv),f(v)≠f(uv),C(u)≠C(v),where C(u) = {f(u)}∪{f(uv)|uv∈E(G)}.Then f is called the adjacent vertex-distinguishing E-total coloring.The minimal number of k is called the adjacent vertexdistinguishing E-total chromatic number of G.The adjacent vertex-distinguishing E-total chromatic number of the multiple join graph of wheel and path are obtained in this paper.
Keywords:the multiple join graph  adjacent vertex-distinguishing E-total coloring  adjacent vertex-distinguishing E-total chromatic number
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号