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

Halin-图的邻强边染色
引用本文:刘林忠,李引珍,张忠辅,王建方.Halin-图的邻强边染色[J].数学研究及应用,2003,23(2):241-246.
作者姓名:刘林忠  李引珍  张忠辅  王建方
作者单位:1. 兰州铁道学院交通运输工程学院,甘肃,兰州,730070
2. 西南交通大学经济管理学院,四川,成都,610036
3. 兰州铁道学院应用数学研究所,甘肃,兰州,730070
4. 中国科学院应用数学研究所,北京,100080
基金项目:Supported by NNSFC(19871036),“Qing Lan”talent funds of Lanzhou Railway Institute.
摘    要:图G(V,E)的正常κ-边染色f叫做图G(V,E)的κ-邻强边染色当且仅当任意uv∈E(G)满足fu]≠fv],其中,fu]={f(uw)|uw∈E(G)},称f是G的κ-临强边染色,简记为κ-ASEC.并且x′as(G)=min{k|κ-ASEC of G}叫做G(V,E)的邻强边色数.本文研究了△(G)≥5的Halin-图的邻强边色数.

关 键 词:领强边染色    邻强边色数    Halin-图
收稿时间:2001/8/11 0:00:00

On the Adjacent Strong Edge Coloring of Halin Graphs
LIU Lin-zhong,LI Yin-zhen,ZHANG Zhong-fu and WANG Jian-fang.On the Adjacent Strong Edge Coloring of Halin Graphs[J].Journal of Mathematical Research with Applications,2003,23(2):241-246.
Authors:LIU Lin-zhong  LI Yin-zhen  ZHANG Zhong-fu and WANG Jian-fang
Institution:School of Traffic. & Transportation Engineering; Lanzhou Railway Institute; Gansu; China;School of Economy mangement; South-West Jiaotong University; Chengdu; China;Inst; of Appl. Math.; Lanzhou Railway Institute; Gansu; China;Inst. of Appl. Math.; Chinese Academy of Science; Beijing; China
Abstract:A proper k-edge coloring y of graph G(V,E) is said to bea 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)} then f is called k-adjacent strong edge coloring of G, is abbreviated k-ASEC; and x'as(G) = min{k|k-ASRC of G} is called the adjacent strong edge chromatic number. In this paper, we study the x'as(G) of Halin graphs with △(G) ≥ 5.
Keywords:adjacent strong edge coloring  adjacent strong edge chromatics number  Halin graph
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《数学研究及应用》浏览原始摘要信息
点击此处可从《数学研究及应用》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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