{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T15:05:49Z","timestamp":1743779149991,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319193144"},{"type":"electronic","value":"9783319193151"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19315-1_11","type":"book-chapter","created":{"date-parts":[[2015,6,6]],"date-time":"2015-06-06T10:42:08Z","timestamp":1433587328000},"page":"122-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A $$\\varGamma $$-magic Rectangle Set and Group Distance Magic Labeling"],"prefix":"10.1007","author":[{"given":"Sylwia","family":"Cichacz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,7]]},"reference":[{"key":"11_CR1","unstructured":"Barrientos, C., Cichacz, S., Froncek, D., Krop, E., Raridan, C.: Distance Magic Cartesian Product of Two Graphs (preprint)"},{"issue":"20","key":"11_CR2","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.dam.2014.05.044","volume":"177","author":"S Cichacz","year":"2014","unstructured":"Cichacz, S.: Group distance magic graphs $$G\\times C_n$$. Discrete Appl. Math. 177(20), 80\u201387 (2014)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"529","DOI":"10.2478\/s11533-013-0356-z","volume":"12","author":"S Cichacz","year":"2014","unstructured":"Cichacz, S.: Note on group distance magic complete bipartite graphs. Cent. Eur. J. Math. 12(3), 529\u2013533 (2014)","journal-title":"Cent. Eur. J. Math."},{"key":"11_CR4","unstructured":"Cichacz, S., Froncek, D.: Distance magic circulant graphs. Preprint Nr MD 071 (2013). http:\/\/www.ii.uj.edu.pl\/documents\/12980385\/26042491\/MD_71.pdf"},{"key":"11_CR5","first-page":"259","volume":"29","author":"D Combe","year":"2004","unstructured":"Combe, D., Nelson, A.M., Palmer, W.D.: Magic labellings of graphs over finite abelian groups. Australas. J. Comb. 29, 259\u2013271 (2004)","journal-title":"Australas. J. Comb."},{"key":"11_CR6","volume-title":"Graph Theory, Graduate Texts in Mathematics","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, Graduate Texts in Mathematics, vol. 173. Springer, Heidelberg (2005)"},{"issue":"2","key":"11_CR7","first-page":"119","volume":"10","author":"D Froncek","year":"2013","unstructured":"Froncek, D.: Handicap distance antimagic graphs and incomplete tournaments. AKCE Int. J. Graphs Comb. 10(2), 119\u2013127 (2013)","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"11_CR8","first-page":"167","volume":"55","author":"D Froncek","year":"2013","unstructured":"Froncek, D.: Group distance magic labeling of Cartesian product of cycles. Australas. J. Combin. 55, 167\u2013174 (2013)","journal-title":"Australas. J. Combin."},{"issue":"2","key":"11_CR9","first-page":"176","volume":"17","author":"H Sun","year":"1997","unstructured":"Sun, H., Yihui, W.: Note on magic squares and magic cubes on Abelian groups. J. Math. Res. Exposition 17(2), 176\u2013178 (1997)","journal-title":"J. Math. Res. Exposition"},{"key":"11_CR10","first-page":"17","volume":"17","author":"JA Gallian","year":"2013","unstructured":"Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Comb. 17, 17\u201320 (2013). #DS6","journal-title":"Electron. J. Comb."},{"key":"11_CR11","first-page":"286","volume":"66","author":"T Harmuth","year":"1881","unstructured":"Harmuth, T.: Ueber magische Quadrate und\u00c9ihnliche Zahlenfiguren. Arch. Math. Phys. 66, 286\u2013313 (1881)","journal-title":"Arch. Math. Phys."},{"key":"11_CR12","first-page":"413","volume":"66","author":"T Harmuth","year":"1881","unstructured":"Harmuth, T.: Ueber magische Rechtecke mit ungeraden Seitenzahlen. Arch. Math. Phys. 66, 413\u2013447 (1881)","journal-title":"Arch. Math. Phys."},{"key":"11_CR13","first-page":"125","volume-title":"Graphs, Combinatorics, Algorithms and Applications","author":"SB Rao","year":"2004","unstructured":"Rao, S.B., Singh, T., Parameswaran, V.: Some sigma labelled graphs I. In: Arumugam, S., Acharya, B.D., Raoeds, S.B. (eds.) Graphs, Combinatorics, Algorithms and Applications, pp. 125\u2013133. Narosa Publishing House, New Delhi (2004)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19315-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T12:25:58Z","timestamp":1675859158000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19315-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319193144","9783319193151"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19315-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"7 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}