{"id":"https://openalex.org/W7116768792","doi":"https://doi.org/10.1007/s10878-025-01377-1","title":"Constructing the antimagic labelings for double stars union paths on three vertices","display_name":"Constructing the antimagic labelings for double stars union paths on three vertices","publication_year":2025,"publication_date":"2025-12-22","ids":{"openalex":"https://openalex.org/W7116768792","doi":"https://doi.org/10.1007/s10878-025-01377-1"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-025-01377-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-025-01377-1","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032486424","display_name":"W. Li","orcid":"https://orcid.org/0000-0003-3817-7357"},"institutions":[{"id":"https://openalex.org/I162838928","display_name":"National Chung Hsing University","ror":"https://ror.org/05vn3ca78","country_code":"TW","type":"education","lineage":["https://openalex.org/I162838928"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Wei-Tian Li","raw_affiliation_strings":["Department of Applied Mathematics, National Chung Hsing University, Taichung, 40227, Taiwan"],"raw_orcid":"https://orcid.org/0000-0003-3817-7357","affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, National Chung Hsing University, Taichung, 40227, Taiwan","institution_ids":["https://openalex.org/I162838928"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109266825","display_name":"Po-Wen Yang","orcid":null},"institutions":[{"id":"https://openalex.org/I162838928","display_name":"National Chung Hsing University","ror":"https://ror.org/05vn3ca78","country_code":"TW","type":"education","lineage":["https://openalex.org/I162838928"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Po-Wen Yang","raw_affiliation_strings":["Department of Applied Mathematics, National Chung Hsing University, Taichung, 40227, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, National Chung Hsing University, Taichung, 40227, Taiwan","institution_ids":["https://openalex.org/I162838928"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032486424"],"corresponding_institution_ids":["https://openalex.org/I162838928"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":1.3257,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.87834289,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"51","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T14187","display_name":"Varied Academic Research Topics","score":0.0007999999797903001,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.000699999975040555,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bijection","display_name":"Bijection","score":0.6686000227928162},{"id":"https://openalex.org/keywords/graph-labeling","display_name":"Graph labeling","score":0.5083000063896179},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49559998512268066},{"id":"https://openalex.org/keywords/disjoint-union","display_name":"Disjoint union (topology)","score":0.4763000011444092},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4652000069618225},{"id":"https://openalex.org/keywords/edge-graceful-labeling","display_name":"Edge-graceful labeling","score":0.4607999920845032},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4018999934196472},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.3555999994277954}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8517000079154968},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8086000084877014},{"id":"https://openalex.org/C24424167","wikidata":"https://www.wikidata.org/wiki/Q180907","display_name":"Bijection","level":2,"score":0.6686000227928162},{"id":"https://openalex.org/C166513658","wikidata":"https://www.wikidata.org/wiki/Q5597093","display_name":"Graph labeling","level":5,"score":0.5083000063896179},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5012000203132629},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49559998512268066},{"id":"https://openalex.org/C7655956","wikidata":"https://www.wikidata.org/wiki/Q5282259","display_name":"Disjoint union (topology)","level":2,"score":0.4763000011444092},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4652000069618225},{"id":"https://openalex.org/C150433608","wikidata":"https://www.wikidata.org/wiki/Q5337633","display_name":"Edge-graceful labeling","level":5,"score":0.4607999920845032},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4018999934196472},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3555999994277954},{"id":"https://openalex.org/C130498168","wikidata":"https://www.wikidata.org/wiki/Q170008","display_name":"Arithmetic progression","level":2,"score":0.3508000075817108},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.3506999909877777},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.3499000072479248},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.33739998936653137},{"id":"https://openalex.org/C80763892","wikidata":"https://www.wikidata.org/wiki/Q958394","display_name":"Hypercube graph","level":5,"score":0.32850000262260437},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.31630000472068787},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3057999908924103},{"id":"https://openalex.org/C2993105083","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Simple graph","level":3,"score":0.2687000036239624},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.2639999985694885},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.257999986410141}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10878-025-01377-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-025-01377-1","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3841286305","display_name":null,"funder_award_id":"NSTC 112-2115-M-005 -002 -MY2","funder_id":"https://openalex.org/F2461203286","funder_display_name":"National Science and Technology Council"}],"funders":[{"id":"https://openalex.org/F2461203286","display_name":"National Science and Technology Council","ror":"https://ror.org/02kv4zf79"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1608199112","https://openalex.org/W2000746207","https://openalex.org/W2083043838","https://openalex.org/W2143198086","https://openalex.org/W2573072382","https://openalex.org/W2592055188","https://openalex.org/W2949865692","https://openalex.org/W3122254133","https://openalex.org/W3151693010","https://openalex.org/W4297924292","https://openalex.org/W4320719390"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2025-12-22T23:14:27.083038","created_date":"2025-12-22T00:00:00"}