{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T05:05:48Z","timestamp":1743656748329},"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\\) be a finite simple undirected \\((p, q)\\)-graph, with vertex set \\(V(G)\\) and edge set \\(E(G)\\) such that \\(p = |V(G)|\\) and \\(q = |E(G)|\\). A super edge-magic total labeling \\(f\\) of \\(G\\) is a bijection \\(f \\colon V(G) \\cup E(G) \\longrightarrow \\{1, 2, \\dots, p+q\\}\\) such that for all edges \\(uv \\in E(G)\\), \\(f(u) + f(v) + f(uv) = c(f)\\), where \\(c(f)\\) is called a magic constant, and \\(f(V(G)) = \\{1, \\dots, p\\}\\). The minimum of all \\(c(f)\\), where the minimum is taken over all the super edge-magic total labelings \\(f\\) of \\(G\\), is defined to be the super edge-magic total strength of the graph \\(G\\). In this article, we work on certain classes of unicyclic graphs and provide evidence to conjecture that the super edge-magic total strength of a certain family of unicyclic \\((p, q)\\)-graphs is equal to \\(2q + \\frac{n+3}{2}\\).<\/jats:p>","DOI":"10.61091\/ars159-08","type":"journal-article","created":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T05:14:41Z","timestamp":1720588481000},"page":"73-85","source":"Crossref","is-referenced-by-count":1,"title":["Super Edge-magic Total Strength of Some Unicyclic Graphs"],"prefix":"10.61091","volume":"159","author":[{"given":"Nayana Shibu","family":"Deepthi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"name":"Department of Pure and Applied Mathematics, Graduate School of Information Science and Technology, Osaka University, Suita, Osaka 565-0871, Japan","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-10T05:14:47Z","timestamp":1720588487000},"score":1,"resource":{"primary":{"URL":"https:\/\/combinatorialpress.com\/ars-articles\/volume-159\/super-edge-magic-total-strength-of-some-unicyclic-graphs\/"}},"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-08","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]]}}}