Distinguishing number and distinguishing index of certain graphs
The distinguishing number (index) D(G) (D0(G)) of a graph G is the least integer d such that G has an vertex labeling (edge labeling) with d labels that is preserved only by a trivial automorphism. In this paper we compute these two parameters for some specific graphs. Also we study the distinguishing number and the distinguishing index of corona product of two graphs.
2019 ◽
Vol 11
(01)
◽
pp. 1950008
Keyword(s):
1981 ◽
Vol 39
◽
pp. 28-29
1968 ◽
Vol 26
◽
pp. 354-355
1992 ◽
Vol 50
(1)
◽
pp. 450-451
1996 ◽
Vol 54
◽
pp. 724-725
Keyword(s):
1986 ◽
Vol 6
(4)
◽
pp. 453-462
◽
1973 ◽
Vol 29
(02)
◽
pp. 363-374
◽