The distinguishing number and the distinguishing index of Cayley graphs

2017/04/13 by Alikhani, Saeid, Soltani, Samaneh
#05C25 #05E18 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1704.04150

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 investigate the distinguishing number and the distinguishing index of Cayley graphs.

Related

• Distinguishing number and distinguishing index of certain graphs
• Distinguishing number and distinguishing index of some operations on graphs
• Trees with distinguishing index equal distinguishing number plus one
• The chromatic distinguishing index of certain graphs
• The distinguishing number (index) and the domination number of a graph