4 citations · 4 across the 6 of their papers we have counts for
6 papers
Optimal Adjacent Vertex-Distinguishing Edge-Colorings of Circulant Graphs
Sylvain Gravier, Hippolyte Signargout, Souad Slimani
A -proper edge-coloring of a graph G is called adjacent vertex-distinguishing if any two adjacent vertices are distinguished by the set of colors appearing in the edges incident…
Twins and Vertex- Identification on Graphs
Sylvain Gravier, Simon Schmidt, Souad Slimani
Recently, several vertex identifying notions were introduced (identifying coloring, lid-coloring, ...), these notions were inspired by identifying codes. All of them, as well as or…
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…
Relaxed Locally Identifying coloring of Graphs
Méziane Aïder, Sylvain Gravier, Souad Slimani
A \textit{locally identifying coloring} (-coloring) of a graph is a proper coloring such that the sets of colors appearing in the closed neighborhoods of any pair of adjacent…