Distinguishing number and distinguishing index of Kronecker product of two graphs

preprint2016arXivOpen access

Abstract

The distinguishing number (index) D(G)D(G) (D′(G)D'(G)) of a graph GG is the least integer dd such that GG has an vertex labeling (edge labeling) with dd labels that is preserved only by a trivial automorphism. The Kronecker product G×HG\times H of two graphs GG and HH is the graph with vertex set V(G)×V(H)V (G)\times V (H) and edge set {{(u,x),(v,y)}∣{u,v}∈E(G) and {x,y}∈E(H)}\{\{(u, x), (v, y)\} | \{u, v\} \in E(G) ~and ~\{x, y\} \in E(H)\}. In this paper we study the distinguishing number and the distinguishing index of Kronecker product of two graphs.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.