Identifying codes of corona product graphs.

Abstract: For a vertex of a graph , let be the set of with all of its neighbors in . A set of vertices is an identifying code of if the sets are nonempty and distinct for all vertices . If admits an identifying code, we say that is identifiable and denote by the minimum cardinality of an identifying code of . In this paper, we study the identifying code of the corona product of graphs and . We first give a necessary and sufficient condition for the corona product to be identifiable, and then express in terms of and the (total) domination number of . Finally, we compute for some special graphs . [Copyright &y& Elsevier]