3 papers
cs.DM2019
Distinguishing numbers and distinguishing indices of oriented graphs
Kahina Meslem, Eric Sopena
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 {…
cs.DM2016
On the Distinguishing Number of Cyclic Tournaments: Towards the Albertson-Collins Conjecture
Kahina Meslem, Eric Sopena
A distinguishing -labeling of a digraph is a mapping from the set of verticesof to the set of labels such that no nontrivial automorphism of pres…
math.CO2015
Game Distinguishing Numbers of Cartesian Products of Graphs
Sylvain Gravier, Kahina Meslem, Simon Schmidt +1
The distinguishing number of a graph is a symmetry related graph invariant whose study started two decades ago. The distinguishing number is the least integer such t…