{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:05Z","timestamp":1740107105113,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T00:00:00Z","timestamp":1627430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T00:00:00Z","timestamp":1627430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100006109","name":"Vedeck\u00e1 Grantov\u00e1 Agent\u00fara M\u0160VVa\u0160 SR a SAV","doi-asserted-by":"publisher","award":["1\/0233\/18"],"award-info":[{"award-number":["1\/0233\/18"]}],"id":[{"id":"10.13039\/501100006109","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005357","name":"Agent\u00fara na Podporu V\u00fdskumu a V\u00fdvoja","doi-asserted-by":"publisher","award":["APVV-19-0153"],"award-info":[{"award-number":["APVV-19-0153"]}],"id":[{"id":"10.13039\/501100005357","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s00373-021-02385-8","type":"journal-article","created":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T15:05:08Z","timestamp":1627484708000},"page":"2713-2721","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Upper Bounds on Inclusive Distance Vertex Irregularity Strength"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7738-0924","authenticated-orcid":false,"given":"Sylwia","family":"Cichacz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7198-0531","authenticated-orcid":false,"given":"Agnieszka","family":"G\u00f6rlich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8432-9836","authenticated-orcid":false,"given":"Andrea","family":"Semani\u010dov\u00e1-Fe\u0148ov\u010d\u00edkov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,28]]},"reference":[{"issue":"4","key":"2385_CR1","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1137\/0403038","volume":"3","author":"M Aigner","year":"1990","unstructured":"Aigner, M., Triesch, E.: Irregular assignments of trees and forests. SIAM J. Discrete Math. 3(4), 439\u2013449 (1990)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"2385_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.5614\/ejgta.2018.6.1.5","volume":"6","author":"M Ba\u010da","year":"2018","unstructured":"Ba\u010da, M., Semani\u010dov\u00e1-Fe\u0148ov\u010d\u00edkov\u00e1, A., Slamin, S., Sugeng, K.A.: On inclusive distance vertex irregular labelings. Electron. J. Graph Theory Appl. 6(1), 61\u201383 (2018)","journal-title":"Electron. J. Graph Theory Appl."},{"key":"2385_CR3","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1007\/s00373-013-1331-y","volume":"30","author":"T Bartnicki","year":"2014","unstructured":"Bartnicki, T., Bosek, B., Czerwi\u0144ski, S., Grytczuk, J., Matecki, G., \u017belazny, W.: Additive coloring of planar graphs. Graphs Comb. 30, 1087\u20131098 (2014)","journal-title":"Graphs Comb."},{"issue":"3","key":"2385_CR4","first-page":"315","volume":"69","author":"NH Bong","year":"2017","unstructured":"Bong, N.H., Lin, Y., Slamin, S: On distance irregular labelings of cycles and wheels. Australas. J. Comb. 69(3), 315\u2013322 (2017)","journal-title":"Australas. J. Comb."},{"key":"2385_CR5","unstructured":"Bong, N.H., Lin, Y., Slamin, S.: On inclusive and non-inclusive vertex irregular $$d$$-distance vertex labelings. J. Combin. Math. Combin. Comput. (2021)"},{"key":"2385_CR6","first-page":"187","volume":"64","author":"G Chartrand","year":"1988","unstructured":"Chartrand, G., Jacobson, M.S., Lehel, J., Oellermann, O., Ruiz, S., Saba, F.: Irregular networks. Congr. Numer. 64, 187\u2013192 (1988)","journal-title":"Congr. Numer."},{"key":"2385_CR7","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1016\/j.ipl.2009.05.011","volume":"109","author":"S Czerwi\u0144ski","year":"2009","unstructured":"Czerwi\u0144ski, S., Grytczuk, J., \u017belazny, W.: Lucky labelings of graphs. Inform. Process. Lett. 109, 1078\u20131081 (2009)","journal-title":"Inform. Process. Lett."},{"key":"2385_CR8","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1137\/090774112","volume":"25","author":"M Kalkowski","year":"2011","unstructured":"Kalkowski, M., Karo\u0144ski, M., Pfender, F.: A new upper bound for the irregularity strength of graphs. SIAM J. Discrete Math. 25, 1319\u20131321 (2011)","journal-title":"SIAM J. Discrete Math."},{"key":"2385_CR9","first-page":"305","volume":"28","author":"M Miller","year":"2003","unstructured":"Miller, M., Rodger, C., Simanjuntak, R.: Distance magic labelings of graphs. Australas. J. Comb. 28, 305\u2013315 (2003)","journal-title":"Australas. J. Comb."},{"issue":"3","key":"2385_CR10","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/S0895480196314291","volume":"13","author":"T Nierhoff","year":"2000","unstructured":"Nierhoff, T.: A tight bound on the irregularity strength of graphs. SIAM J. Discrete Math. 13(3), 313\u2013323 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"2385_CR11","volume-title":"Pearls of Graph Theory","author":"G Ringel","year":"1990","unstructured":"Ringel, G., Hartsfield, N.: Pearls of Graph Theory. Academic Press, London (1990)"},{"issue":"5","key":"2385_CR12","doi-asserted-by":"publisher","first-page":"919","DOI":"10.17654\/MS102050919","volume":"102","author":"S Slamin","year":"2017","unstructured":"Slamin, S.: On distance irregular labelings of graphs. Far East J. Math. Sci. (FJMS) 102(5), 919\u2013932 (2017)","journal-title":"Far East J. Math. Sci. (FJMS)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02385-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02385-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02385-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T21:31:11Z","timestamp":1636839071000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02385-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,28]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["2385"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02385-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2021,7,28]]},"assertion":[{"value":"10 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}