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

△(G)=4的Halin-图的邻强边染色
引用本文:卫斌,刘林忠,张忠辅.△(G)=4的Halin-图的邻强边染色[J].经济数学,2001,18(4):82-85.
作者姓名:卫斌  刘林忠  张忠辅
摘    要:图G(V,E)的一正常k-边染色f称为G(V,E)的一k-邻强边染色(简称k-ASEC)当且仅当任意uv∈E(G)满足fu]≠fv],其中fu]={f(uw)|uw∈E(G)},并称Xas(G)=min{k|存在G的一k-ASEC}为G的邻强边色数.本文研究了△(G)=4的Halin-图的邻强边染色,得到了如下结果对△(G)=4的Halin-图有△(G)=4≤Xas(G)≤△(G)+1=5.

关 键 词:  邻强边染色  邻强边色数

ON THE ADJACENT STRONG EDGE COLORINGS OF HALIN-GRAPHS WITH A (G) = 4
Abstract.ON THE ADJACENT STRONG EDGE COLORINGS OF HALIN-GRAPHS WITH A (G) = 4[J].Mathematics in Economics,2001,18(4):82-85.
Authors:Abstract
Abstract:A proper k-edge coloring f of graph G(V,E) is said to be a k-adjacent strong edge coloring of graph G(V,E) iff every uv∈ E(G) satisfy fu]≠fv], where fu]= {f (uw) |uw∈ E(G) } ; and xas(G)=min| {f(e) |e∈E} | is called the adjacent strong edge chromatic mumber. In this paper, we study the xas(G)of Halin praphs with △(G)=4.
Keywords:Adjacent strong edge coloring  Adjacent strong edge chromatics number  Halin graph
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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