有向图的邻点可区别弧染色  

Neighbor-distinguishing Arc Colorings of Digraphs

作　　者：季强 王纪辉 JI Qiang;WANG Ji-hui(School of Mathematical Sciences,University of Jinan,Jinan 250022,China)

机构地区：[1]济南大学数学科学学院,济南250022

出　　处：《青岛大学学报（自然科学版）》2023年第2期1-4,共4页Journal of Qingdao University(Natural Science Edition)

基　　金：国家自然科学基金(批准号:12071351)资助;山东省自然科学基金(批准号:ZR2020MA043)资助。

摘　　要：研究了有向图的邻点可区别弧染色,证明了每个有向图D都有χ′_(-,+)(D)≤Δ*(D)+2。对于完全有向图,完全对称二部有向图和有向树,给出了邻点可区别弧染色数的更精确结果。Neighbor-distinguishing arc coloring of digraphs was studied.It was proved that for every digraph D,χ′_(-,+)(D)≤Δ*(D)+2.For some special digraphs,such as complete digraphs,complete symmetric bipartite digraphs and directed trees,their neighbor-distinguishing arc chromatic number was given.

关 键 词：有向图 邻点可区别弧染色 特殊有向图 

分 类 号：O157.5[理学—数学]