3 research outputs found
Identifying codes of corona product graphs
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 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
identifiable corona product , and then express in terms of and the (total) domination number of .
Finally, we compute for some special graphs
Problems in Domination and Graph Products
The \u27domination chain,\u27\u27 first proved by Cockayne, Hedetniemi, and Miller in 1978, has been the focus of much research. In this work, we continue this study by considering unique realizations of its parameters. We first consider unique minimum dominating sets in Cartesian product graphs. Our attention then turns to unique minimum independent dominating sets in trees, and in some direct product graphs. Next, we consider an extremal graph theory problem and determine the maximum number of edges in a graph having a unique minimum independent dominating set or a unique minimum maximal irredundant set of cardinality two. Finally, we consider a variation of domination, called identifying codes, in the Cartesian product of a complete graph and a path