乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T16:59:23Z","timestamp":1726851563542},"reference-count":9,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100009935","name":"Indo French Centre for Applied Mathematics","doi-asserted-by":"publisher","award":["MA\/IFCAM\/18\/39"],"id":[{"id":"10.13039\/100009935","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["MTR\/2021\/000858","SRG\/2020\/001575"],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002341","name":"Academy of Finland","doi-asserted-by":"publisher","award":["338797"],"id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003125","name":"Suomen Kulttuurirahasto","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003125","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005276","name":"National Board for Higher Mathematics","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005276","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1016\/j.ipl.2023.106386","type":"journal-article","created":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T16:25:13Z","timestamp":1677774313000},"page":"106386","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["On radio k-labeling of the power of the infinite path"],"prefix":"10.1016","volume":"182","author":[{"given":"Tapas","family":"Das","sequence":"first","affiliation":[]},{"given":"Tuomo","family":"Lehtil\u00e4","sequence":"additional","affiliation":[]},{"given":"Soumen","family":"Nandi","sequence":"additional","affiliation":[]},{"given":"Sagnik","family":"Sen","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-4792-349X","authenticated-orcid":false,"given":"D.K.","family":"Supraja","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"18","key":"10.1016\/j.ipl.2023.106386_br0010","doi-asserted-by":"crossref","first-page":"2876","DOI":"10.1016\/j.dam.2013.06.024","article-title":"Radio labelings of distance graphs","volume":"161","author":"\u010cada","year":"2013","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.ipl.2023.106386_br0020","author":"Chakraborty"},{"issue":"5","key":"10.1016\/j.ipl.2023.106386_br0030","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1016\/j.disc.2016.12.021","article-title":"A lower bound technique for radio k-coloring","volume":"340","author":"Das","year":"2017","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/j.ipl.2023.106386_br0040","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/0405048","article-title":"Labelling graphs with a condition at distance 2","volume":"5","author":"Griggs","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.ipl.2023.106386_br0050","series-title":"ACM-SIAM Symposium on Discrete Algorithms (SODA 2008)","first-page":"621","article-title":"L (2, 1)-labelling of graphs","author":"Havet","year":"2008"},{"issue":"1","key":"10.1016\/j.ipl.2023.106386_br0060","doi-asserted-by":"crossref","first-page":"105","DOI":"10.7151\/dmgt.1348","article-title":"Linear and cyclic radio k-labelings of trees","volume":"27","author":"Kchikech","year":"2007","journal-title":"Discuss. Math., Graph Theory"},{"key":"10.1016\/j.ipl.2023.106386_br0070","first-page":"307","article-title":"Radio number for square paths","volume":"90","author":"Liu","year":"2009","journal-title":"Ars Comb."},{"issue":"3","key":"10.1016\/j.ipl.2023.106386_br0080","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1137\/S0895480102417768","article-title":"Multilevel distance labelings for paths and cycles","volume":"19","author":"Liu","year":"2005","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.ipl.2023.106386_br0090","series-title":"Introduction to Graph Theory, vol. 2","author":"West","year":"2001"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019023000297?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019023000297?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T15:41:25Z","timestamp":1684251685000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019023000297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":9,"alternative-id":["S0020019023000297"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2023.106386","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2023,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On radio k-labeling of the power of the infinite path","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2023.106386","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"106386"}}