{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T05:51:37Z","timestamp":1678254697753},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"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":[[2023,3]]},"DOI":"10.1007\/s10878-023-01008-7","type":"journal-article","created":{"date-parts":[[2023,3,7]],"date-time":"2023-03-07T09:02:56Z","timestamp":1678179776000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distance magic labeling of the halved folded n-cube"],"prefix":"10.1007","volume":"45","author":[{"given":"Yi","family":"Tian","sequence":"first","affiliation":[]},{"given":"Na","family":"Kang","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[]},{"given":"Suogang","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,7]]},"reference":[{"issue":"7","key":"1008_CR1","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1016\/j.disc.2015.12.025","volume":"339","author":"M Anholcer","year":"2016","unstructured":"Anholcer M, Cichacz S, Peterin I (2016) Spectra of graphs and closed distance magic labelings. Discret Math 339(7):1915\u20131923","journal-title":"Discret Math"},{"issue":"5","key":"1008_CR2","doi-asserted-by":"publisher","first-page":"1125","DOI":"10.1007\/s00373-014-1455-8","volume":"31","author":"M Anholcer","year":"2015","unstructured":"Anholcer M, Cichacz S, Peterin I, Tepeh A (2015) Distance magic labeling and two products of graphs. Graphs Combin 31(5):1125\u20131136","journal-title":"Graphs Combin"},{"key":"1008_CR3","unstructured":"Anuwiksa P, Munemasa A, Simanjuntak R (2019) $$D$$-magic and antimagic labelings of hypercubes. arXiv:1903.05005v2 [math.CO]"},{"issue":"2","key":"1008_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(94)00197-Q","volume":"140","author":"S Bettayeb","year":"1995","unstructured":"Bettayeb S (1995) On the $$k$$-ary hypercube. Theor Comput Sci 140(2):333\u2013339","journal-title":"Theor Comput Sci"},{"key":"1008_CR5","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1109\/PROC.1977.10517","volume":"65","author":"GS Bloom","year":"1977","unstructured":"Bloom GS, Golomb SW (1977) Applications of numbered undirected graphs. Proc IEEE 65:562\u2013570","journal-title":"Proc IEEE"},{"key":"1008_CR6","doi-asserted-by":"crossref","unstructured":"Bloom GS, Golomb SW (1978) Numbered complete graphs, unusual rulers, and assorted applications. In: Alavi Y, Lick DR (eds) Theory and applications of graphs. Lecture notes in mathematics, Vol 642. Springer, Berlin, pp 53\u201365. https:\/\/doi.org\/10.1007\/BFb0070364","DOI":"10.1007\/BFb0070364"},{"issue":"8","key":"1008_CR7","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1109\/12.403718","volume":"44","author":"B Bose","year":"1995","unstructured":"Bose B, Broeg B, Kwon Y, Ashir Y (1995) Lee distance and topological properties of $$k$$-ary $$n$$-cubes. IEEE Trans Comput 44(8):1021\u20131030","journal-title":"IEEE Trans Comput"},{"key":"1008_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74341-2","volume-title":"Distance-regular graphs","author":"AE Brouwer","year":"1989","unstructured":"Brouwer AE, Cohen AM, Neumaier A (1989) Distance-regular graphs. Springer-Verlag, Berlin"},{"key":"1008_CR9","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1016\/j.procs.2013.05.145","volume":"17","author":"P Chebotarev","year":"2013","unstructured":"Chebotarev P, Agaev R (2013) Matrices of forests, analysis of networks, and ranking problems. Procedia Comput Sci 17:1134\u20131141","journal-title":"Procedia Comput Sci"},{"issue":"2","key":"1008_CR10","doi-asserted-by":"publisher","first-page":"299","DOI":"10.7151\/dmgt.1852","volume":"36","author":"S Cichacz","year":"2016","unstructured":"Cichacz S, Fron\u010dek D, Krop E, Raridan C (2016) Distance magic cartesian products of graphs. Discuss Math Graph Theory 36(2):299\u2013308","journal-title":"Discuss Math Graph Theory"},{"issue":"9","key":"1008_CR11","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1109\/71.615436","volume":"8","author":"K Day","year":"1997","unstructured":"Day K, Al-Ayyoub AE (1997) Fault diameter of $$k$$-ary $$n$$-cube networks. IEEE Trans Parallel Distrib Syst 8(9):903\u2013907","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1008_CR12","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.endm.2013.05.027","volume":"40","author":"P Gregor","year":"2013","unstructured":"Gregor P, Kov\u00e1\u0159 P (2013) Distance magic labelings of hypercubes. Electron Notes Discret Math 40:145\u2013149","journal-title":"Electron Notes Discret Math"},{"issue":"20","key":"1008_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2012.03.030","volume":"443","author":"SY Hsieh","year":"2012","unstructured":"Hsieh SY, Chang YH (2012) Extraconnectivity of $$k$$-ary $$n$$-cube networks. Theor Comput Sci 443(20):63\u201369","journal-title":"Theor Comput Sci"},{"key":"1008_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tcs.2016.04.014","volume":"634","author":"CK Lin","year":"2016","unstructured":"Lin CK, Zhang LL, Fan JX, Wang DJ (2016) Structure connectivity and substructure connectivity of hypercubes. Theor Comput Sci 634:97\u2013107","journal-title":"Theor Comput Sci"},{"key":"1008_CR15","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.2430","author":"\u0160 Miklavi\u010d","year":"2021","unstructured":"Miklavi\u010d \u0160, \u0160parl P (2021) On distance magic labelings of Hamming graphs and folded hypercubes. Discuss Math Graph Theory. https:\/\/doi.org\/10.7151\/dmgt.2430","journal-title":"Discuss Math Graph Theory"},{"key":"1008_CR16","first-page":"305","volume":"28","author":"M Miller","year":"2003","unstructured":"Miller M, Rodger C, Simanjuntak R (2003) Distance magic labelings of graphs. Aust J Comb 28:305\u2013315","journal-title":"Aust J Comb"},{"issue":"2","key":"1008_CR17","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1137\/110834421","volume":"27","author":"A O\u2019Neal","year":"2013","unstructured":"O\u2019Neal A, Slater PJ (2013) Uniqueness of vertex magic constants. SIAM J Discret Math 27(2):708\u2013716","journal-title":"SIAM J Discret Math"},{"key":"1008_CR18","doi-asserted-by":"crossref","unstructured":"Prajeesh AV, Paramasivam K, Kamatchi N (2019) A note on handicap incomplete tournaments. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) vol 11638, pp 1\u20139","DOI":"10.1007\/978-3-030-25005-8_1"},{"key":"1008_CR19","unstructured":"Sedl\u00e1\u010dek J, (1964) Some properties of interchange graphs. Theory of Graphs and its Applications (Proc. Sympos. Smolenice, (1963). House Czech. Acad. Sci, Prague, pp 145\u2013150"},{"issue":"3","key":"1008_CR20","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1016\/j.akcej.2019.12.019","volume":"17","author":"R Simanjuntak","year":"2020","unstructured":"Simanjuntak R, Anuwiksa P (2020) $$D$$-magic strongly regular graphs. AKCE Int J Graphs Comb 17(3):995\u2013999","journal-title":"AKCE Int J Graphs Comb"},{"issue":"1\u20133","key":"1008_CR21","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0012-365X(97)80334-2","volume":"174","author":"E Sim\u00f3","year":"1997","unstructured":"Sim\u00f3 E, Yebra JLA (1997) The vulnerability of the diameter of folded $$n$$-cubes. Discret Math 174(1\u20133):317\u2013322","journal-title":"Discret Math"},{"issue":"9","key":"1008_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112520","volume":"344","author":"Y Tian","year":"2021","unstructured":"Tian Y, Hou LH, Hou B, Gao SG (2021) $$D$$-magic labelings of the folded $$n$$-cube. Discret Math 344(9):112520","journal-title":"Discret Math"},{"key":"1008_CR23","doi-asserted-by":"crossref","unstructured":"van Dam ER, Koolen JH, Tanaka H (2016) Distance-regular graphs. Electron J Combin DS22","DOI":"10.37236\/4925"},{"key":"1008_CR24","unstructured":"Vilfred V (1994) Sigma labelled graphs and circulant graphs. Ph.D. thesis, University of Kerala"},{"key":"1008_CR25","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2016.05.035","volume":"640","author":"SL Zhao","year":"2016","unstructured":"Zhao SL, Yang WH, Zhang SR (2016) Component connectivity of hypercubes. Theor Comput Sci 640:115\u2013118","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01008-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01008-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01008-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,7]],"date-time":"2023-03-07T09:23:01Z","timestamp":1678180981000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01008-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["1008"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01008-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3]]},"assertion":[{"value":"16 February 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2023","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 declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"75"}}