首页|Proper distinguishing arc-colourings of symmetric digraphs
Proper distinguishing arc-colourings of symmetric digraphs
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
A symmetric digraph (G) over left right arrow arises from a simple graph G by substituting each edge uv by a pair of opposite arcs (uv) over right arrow, (vu) over right arrow An arc-colouring cof.. G is distinguishing if the only automorphism of (G) over left right arrow preserving cis the identity. We study four types of proper arc-colourings of (G) over left right arrow corresponding to four definitions of adjacency of arcs. For each type, we investigate the distinguishing chromatic index of (G) over left right arrow, i.e. the least number of colours in a distinguishing proper colouring of (G) over left right arrow. We also determine tight bounds for chromatic indices of (G) over left right arrow, i.e. for the least numbers of colours in each type of proper colourings. Colourings of arcs of a symmetric digraph (G) over left right arrow are equivalent to colourings of halfedges of the graph G, which have applications in computer science. (C) 2022 Elsevier Inc. All rights reserved.
NSTL
Elsevier
