Locally Identifying Coloring of Graphs

[摘要] We introduce the notion of locally identifying coloring of a graph. A proper vertex-coloring $c$ of a graph $G$ is said to be locally identifying, if for any adjacent vertices $u$ and $v$ with distinct closed neighborhoods, the sets of colors that appear

[学科分类] 离散数学和组合数学

[关键词] Graph theory;Coloring;Identifying code