29 citations · 47 across the 16 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.CO2013
Identifying codes of Cartesian product of two cliques
Yingnan Zhang, Min Feng, Kaishun Wang
An identifying code in a graph is a dominating set such that the closed neighborhood of each vertex in has a distinct intersection with . In 2008, Gravier et al. det…
math.CO2013
Identifying codes of corona product graphs
Min Feng, Kaishun Wang
For a vertex of a graph , let be the set of with all of its neighbors in . A set of vertices is an {\em identifying code} of if the sets $N_G[x]\cap…