{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T00:25:26Z","timestamp":1720657526925},"reference-count":0,"publisher":"Combinatorial Press","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ars Comb."],"published-print":{"date-parts":[[2024,6,30]]},"abstract":"<jats:p>Let \\(G = (V, E)\\) be a graph with vertex set \\(V\\) and edge set \\(E\\). An edge labeling \\(f: E \\to Z_{2}\\) induces a vertex labeling \\(f^{+} : V \\to Z_{2}\\) defined by \\( f^{+}(v) \\equiv \\sum_{uv \\in E} f(uv) \\pmod 2 \\), for each vertex \\(v \\in V\\). For \\(i \\in Z_{2}\\), let \\( v_{f}(i) = |\\{v \\in V : f^+(v) = i\\}| \\) and \\( e_{f}(i) = |\\{e \\in E : f(e) = i\\}| \\). An edge labeling \\(f\\) of a graph \\(G\\) is said to be edge-friendly if \\( |e_{f}(1) \u2013 e_{f}(0)| \\le 1 \\). The set \\(\\{v_f(1) \u2013 v_f(0) : f \\text{ is an edge-friendly labeling of } G\\}\\) is called the full edge-friendly index set of \\(G\\). In this paper, we shall determine the full edge-friendly index sets of one point union of cycles.<\/jats:p>","DOI":"10.61091\/ars159-03","type":"journal-article","created":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T04:53:12Z","timestamp":1720587192000},"page":"21-30","source":"Crossref","is-referenced-by-count":0,"title":["Full Edge-Friendly Index Sets of One Point Union of Cycles"],"prefix":"10.61091","volume":"159","author":[{"given":"Zhen-Bin","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"name":"College of General Education, Guangdong University of Science and Technology, Dongguan, 523000, P.R. China","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"39747","published-online":{"date-parts":[[2024,6,30]]},"container-title":["Ars Combinatoria"],"original-title":[],"deposited":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T04:53:17Z","timestamp":1720587197000},"score":1,"resource":{"primary":{"URL":"https:\/\/combinatorialpress.com\/ars-articles\/volume-159\/full-edge-friendly-index-sets-of-one-point-union-of-cycles\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,30]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,6,30]]},"published-print":{"date-parts":[[2024,6,30]]}},"URL":"https:\/\/doi.org\/10.61091\/ars159-03","relation":{},"ISSN":["0381-7032","2817-5204"],"issn-type":[{"value":"0381-7032","type":"print"},{"value":"2817-5204","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,30]]}}}