A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Distinguishing numbers and distinguishing indices of oriented graphs
[article]

2020
*
arXiv
*
pre-print

A distinguishing r-vertex-labelling (resp. r-edge-labelling) of an undirected graph G is a mapping λ from the set of vertices (resp. the set of edges) of G to the set of labels 1,. .. , r such that no non-trivial automorphism of G preserves all the vertex (resp. edge) labels. The distinguishing number D(G) and the distinguishing index D (G) of G are then the smallest r for which G admits a distinguishing r-vertex-labelling or r-edge-labelling, respectively. The distinguishing chromatic number D

arXiv:1910.12738v2
fatcat:w6f2qbbssvegllntl7vubqgl74