For a graph G and a positive integer k , a vertex labelling f : V ( G ) → {1, 2, …, k } is said to be k -distinguishing if no non-trivial automorphism of G preserves the sets f − 1 ( i ) for each i ∈ {1, …, k } . The distinguishing chromatic number of a graph G , denoted χ D ( G ) , is defined as the minimum k such that there is a k -distinguishing labelling of V ( G ) which is also a proper coloring of the vertices of G . In this paper, we prove the following theorem: Given k ∈ ℕ , there exists an infinite sequence of vertex-transitive graphs G i = ( V i , E i ) such that χ D ( G i ) > χ( G i ) > k , |Aut( G i )