On the diameter of the Kronecker product graph

2012/04/18 by Fu-Tao Hu, Hu, Fu-Tao, Jun‐Ming Xu +1 · 1 citation
Computer Science · Mathematics · #05C12 #05C50 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications

paper · pdf · doi:10.48550/arxiv.1204.4014

openalex publication_date 2012/04/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let G₁ and G₂ be two undirected nontrivial graphs. The Kronecker product of G₁ and G₂ denoted by G₁⊗ G₂ with vertex set V(G₁)× V(G₂), two vertices x₁x₂ and y₁y₂ are adjacent if and only if (x₁,y₁)∈ E(G₁) and (x₂,y₂)∈ E(G₂). This paper presents a formula for computing the diameter of G₁⊗ G₂ by means of the diameters and primitive exponents of factor graphs.

Citations

• Kronecker Graphs: An Approach to Modeling Networks

Cited by

• When Are Standard Graph Products Isomorphic?

Related

• On the diameter of Kronecker graphs
• Diameter of generalized Petersen graphs
• On the diameter of Schrijver graphs
• A new approach for computing the distance and the diameter in circulant graphs
• The diameter of strong orientations of strong products of graphs