{"paper":{"title":"On the diameter of the Kronecker product graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fu-Tao Hu, Jun-Ming Xu","submitted_at":"2012-04-18T08:33:41Z","abstract_excerpt":"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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4014","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}