On the diameter of the Kronecker product graph
arXiv:1204.4014
Abstract
Let and be two undirected nontrivial graphs. The Kronecker product of and denoted by with vertex set , two vertices and are adjacent if and only if and . This paper presents a formula for computing the diameter of by means of the diameters and primitive exponents of factor graphs.
9 pages, 18 references