{"paper":{"title":"On Generalized Edge Corona Product of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Freydoon Rahbarnia, Irandokht Rezaee Abdolhosseinzadeh","submitted_at":"2017-12-13T10:57:09Z","abstract_excerpt":"Let $G$ be a simple graph with $m$ edges and $H_i$, $1\\leq i \\leq m$ be simple graphs too. The generalized edge corona product of graphs $G$ and $H_1, ..., H_m$, denoted by $G \\diamond (H_1, ..., H_m)$, is obtained by taking one copy of graphs $G$, $H_1, ..., H_m$ and joining two end vertices of $i$-th edge of $G$ to every vertex of $H_i$, $1\\leq i \\leq m$. In this paper, some results regarding the $k$-distance chromatic number of Generalized edge corona product of graphs are presented. Also, as a consequence of our results, we compute this invariant for the graphs $K_n \\diamond (H_1, ..., H_m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04699","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"}