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 Kronecker product of two graphs and is the graph with vertex set and edge set . In this paper we study the distinguishing number and the distinguishing index of Kronecker product of two graphs.
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.