{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T16:10:05Z","timestamp":1748016605899,"version":"3.41.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s10878-025-01309-z","type":"journal-article","created":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T12:36:02Z","timestamp":1747312562000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Neighbor sum distinguishable $$k$$ -edge colorings of joint graphs"],"prefix":"10.1007","volume":"49","author":[{"given":"Xiangzhi","family":"Tu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yangjing","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aifa","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,15]]},"reference":[{"key":"1309_CR1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.dam.2014.03.017","volume":"174","author":"D Aijun","year":"2014","unstructured":"Aijun D, Guanghui W, Jianghua Z (2014) Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree. Discrete Appl Math 174:73\u201384","journal-title":"Discrete Appl Math"},{"issue":"2","key":"1309_CR2","first-page":"197","volume":"21","author":"AC Burris","year":"1997","unstructured":"Burris AC, Schelp RH (1997) Vertex- distinguishing proper edge-colorings. J Graph Theory 21(2):197\u2013205","journal-title":"J Graph Theory"},{"issue":"5","key":"1309_CR3","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1007\/s00373-012-1191-x","volume":"29","author":"E Flandrin","year":"2013","unstructured":"Flandrin E et al (2013) Neighbor sum distinguishing index. Graphs Comb 29(5):1329\u20131336","journal-title":"Graphs Comb"},{"key":"1309_CR4","unstructured":"Gupta RK, Sharma RK (2018) Resource scheduling and optimization for cloud computing: A review. Journal of Computer Networks and Communications 2018:1\u201313"},{"issue":"1","key":"1309_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10878-018-0271-0","volume":"36","author":"M Han","year":"2018","unstructured":"Han M et al (2018) Neighbor sum distinguishing total coloring of graphs with bounded treewidth. J Combin Optim 36(1):23\u201334","journal-title":"J Combin Optim"},{"issue":"12","key":"1309_CR6","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.3390\/axioms12121132","volume":"12","author":"J Huo","year":"2023","unstructured":"Huo J et al (2023) Neighbor distinguishing colorings of graphs with the restriction for maximum average degree. Axioms 12(12):1132","journal-title":"Axioms"},{"key":"1309_CR7","first-page":"116","volume":"185","author":"X Hu","year":"2015","unstructured":"Hu X, Chen Y, Luo R, Miao Z (2015) Neighbor sum distinguishing edge colorings of sparse graphs. Discrete Appl Math 185:116\u2013124","journal-title":"Discrete Appl Math"},{"issue":"2","key":"1309_CR8","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/j.disc.2017.09.023","volume":"341","author":"Y Lu","year":"2018","unstructured":"Lu Y, Huan Y, Tian S (2018) List neighbor sum distinguishing edge coloring of subcubic graphs. Discrete Math 341(2):555\u2013569","journal-title":"Discrete Math"},{"issue":"9","key":"1309_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2024.114095","volume":"347","author":"T Kittipassorn","year":"2024","unstructured":"Kittipassorn T, Sanyatit P (2024) Union vertex-distinguishing edge colorings. Discrete Math 347(9):114095","journal-title":"Discrete Math"},{"issue":"2","key":"1309_CR10","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.disc.2016.08.012","volume":"340","author":"S Loeb","year":"2017","unstructured":"Loeb S, Przybylo J, Tang Y (2017) Asymptotically optimal neighbor sum distinguishing total colorings of graphs. Discrete Math 340(2):58\u201362","journal-title":"Discrete Math"},{"key":"1309_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.dam.2017.12.001","volume":"237","author":"Y Lu","year":"2018","unstructured":"Lu Y, Han M, Luo R (2018) Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring. Discrete Appl Math 237:109\u2013115","journal-title":"Discrete Appl Math"},{"issue":"7","key":"1309_CR12","volume":"347","author":"Y Lu","year":"2023","unstructured":"Lu Y et al (2023) List neighbor sum distinguishing edge coloring of subcubic graphs. Discrete Math 347(7):114079","journal-title":"Discrete Math"},{"issue":"11","key":"1309_CR13","first-page":"83","volume":"56","author":"H Qiang","year":"2021","unstructured":"Qiang H, Yao L (2021) 2-Distance and distinguishable edge coloring of graphs without (K4)- minor. J Shandong Univ Nat Sci 56(11):83\u201386","journal-title":"J Shandong Univ Nat Sci"},{"issue":"8","key":"1309_CR14","doi-asserted-by":"publisher","first-page":"2064","DOI":"10.1016\/j.disc.2020.111918","volume":"343","author":"W Song","year":"2020","unstructured":"Song W, Duan Y, Miao L (2020) Neighbor sum distinguishing total coloring of IC-planar graphs. Discrete Math 343(8):2064\u20132077","journal-title":"Discrete Math"},{"issue":"9","key":"1309_CR15","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.dam.2014.05.013","volume":"175","author":"GH Wang","year":"2014","unstructured":"Wang GH, Yan GY (2014) An improved upper bound for the neighbor sum distinguishing index of graphs. Discrete Appl Math 175(9):126\u2013128","journal-title":"Discrete Appl Math"},{"issue":"3","key":"1309_CR16","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1137\/1021086","volume":"21","author":"WD Wallis","year":"2006","unstructured":"Wallis WD (2006) Graph Theory with Applications (J. A. Bondy and U. S. R. Murty). SIAM Review 21(3):429\u2013429","journal-title":"SIAM Review"},{"key":"1309_CR17","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.dam.2024.05.002","volume":"356","author":"X Yu","year":"2024","unstructured":"Yu X (2024) An improved upper bound for neighbor sum distinguishing edge colorings of graphs. Discrete Appl Math 356:104\u2013109","journal-title":"Discrete Appl Math"},{"issue":"5","key":"1309_CR18","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/S0893-9659(02)80015-5","volume":"15","author":"Z Zhang","year":"2002","unstructured":"Zhang Z, Liu L, Wang J (2002) Adjacent strong edge coloring of graphs. Appl Math Lett 15(5):497\u2013502","journal-title":"Appl Math Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01309-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-025-01309-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01309-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T15:34:52Z","timestamp":1748014492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-025-01309-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["1309"],"URL":"https:\/\/doi.org\/10.1007\/s10878-025-01309-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2025,5]]},"assertion":[{"value":"19 April 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors report there are no competing interests to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"68"}}