On the diameter of the Kronecker product graph
Abstract
Let G1 and G2 be two undirected nontrivial graphs. The Kronecker product of G1 and G2 denoted by G1 G2 with vertex set V(G1)× V(G2), two vertices x1x2 and y1y2 are adjacent if and only if (x1,y1)∈ E(G1) and (x2,y2)∈ E(G2). This paper presents a formula for computing the diameter of G1 G2 by means of the diameters and primitive exponents of factor graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.