2 papers
math.CO2014
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…
math.CO2014
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…