4 citations · 4 across the 3 of their papers we have counts for
5 papers
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 {…
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…
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…
A New Game Invariant of Graphs: the Game Distinguishing Number
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…
Distinguishing Number for some Circulant Graphs
Sylvain Gravier, Kahina Meslem, Souad Slimani
Introduced by Albertson et al. \cite{albertson}, the distinguishing number of a graph is the least integer such that there is a -labeling of the vertices of t…