THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH

The distinguishing number d(g) of a graph g is the least integer d such that g has an vertex labeling with d labels that is preserved only by a trivial automorphism. the minimum size of a label class in such a labeling of g with d(g) = d is called the cost of d-distinguishing g and is denoted by d(g). a set of vertices s  v (g) is a determining set for g if every automorphism of g is uniquely determined by its action on s. the determining number of g, det(g), is the minimum cardinality of determining sets of g. in this paper we compute the cost and the determining number for the friendship graphs and corona product of two graphs.