DISTINGUISHING NUMBER AND DISTINGUISHING INDEX OF JOIN OF TWO SPECIFIC GRAPHS
The distinguishing number (index) of a graph G is the least integer d such that G has a vertex labeling (edge labeling) with d labels that is preserved only by a trivial automorphism. In this paper, we compute the distinguishing number and the distinguishing index for the join of two specific graphs.
distinguishing index, distinguishing number, join.