Distinguishing number and distinguishing index of certain graphs

2016/02/10 by Alikhani, Saeid, Soltani, Samaneh
#05C15 #05E18 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1602.03302

Abstract

The distinguishing number (index) D(G) (D'(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.

Related

• Distinguishing number and distinguishing index of neighbourhood corona of two graphs
• The distinguishing number and the distinguishing index of Cayley graphs
• The chromatic distinguishing index of certain graphs
• Distinguishing number and distinguishing index of some operations on graphs
• Distinguishing number and distinguishing index of graphs from primary\n subgraphs