{"paper":{"title":"The rainbow connection number of the power graph of a finite group","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaishun Wang, Min Feng, Xuanlong Ma","submitted_at":"2014-12-18T13:19:36Z","abstract_excerpt":"This paper studies the rainbow connection number of the power graph $\\Gamma_G$ of a finite group $G$. We determine the rainbow connection number of $\\Gamma_G$ if $G$ has maximal involutions or is nilpotent, and show that the rainbow connection number of $\\Gamma_G$ is at most three if $G$ has no maximal involutions. The rainbow connection numbers of power graphs of some nonnilpotent groups are also given."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5849","kind":"arxiv","version":2},"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"}