On the diameter of the Kronecker product graph
classification
🧮 math.CO
keywords
diametergraphskroneckerotimesproductadjacentcomputingdenoted
read the original abstract
Let $G_1$ and $G_2$ be two undirected nontrivial graphs. The Kronecker product of $G_1$ and $G_2$ denoted by $G_1\otimes G_2$ with vertex set $V(G_1)\times V(G_2)$, two vertices $x_1x_2$ and $y_1y_2$ are adjacent if and only if $(x_1,y_1)\in E(G_1)$ and $(x_2,y_2)\in E(G_2)$. This paper presents a formula for computing the diameter of $G_1\otimes G_2$ by means of the diameters and primitive exponents of factor graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.