Abstract
The distinguishing number (index) () of a graph is the least integer such that has an vertex labeling (edge labeling) with labels that is preserved only by a trivial automorphism. The lexicographic product of two graphs and , can be obtained from by substituting a copy of for every vertex of and then joining all vertices of with all vertices of if . In this paper we obtain some sharp bounds for the distinguishing number and the distinguishing index of lexicographic product of two graphs. As consequences, we prove that if is a connected graph with a special condition on automorphism group of and , then for every natural , , where . Also we prove that all lexicographic powers of , () can be distinguished by at most two edge labels.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.