12,552 research outputs found
On the diameter of the Kronecker product graph
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.Comment: 9 pages, 18 reference
- β¦