{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:00Z","timestamp":1759063800294},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,5,22]],"date-time":"2014-05-22T00:00:00Z","timestamp":1400716800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s00373-014-1453-x","type":"journal-article","created":{"date-parts":[[2014,5,21]],"date-time":"2014-05-21T10:51:08Z","timestamp":1400669468000},"page":"1117-1124","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Note on Distance Magic Products $$G\\circ C_4$$ G \u2218 C 4"],"prefix":"10.1007","volume":"31","author":[{"given":"Marcin","family":"Anholcer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylwia","family":"Cichacz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,22]]},"reference":[{"key":"1453_CR1","doi-asserted-by":"crossref","unstructured":"Anholcer, M., Cichacz, S., Peterin, I., Tepeh, A.: Distance magic labeling and two products of graphs. Graphs Combin. (2014) (accepted)","DOI":"10.1007\/s00373-014-1455-8"},{"key":"1453_CR2","doi-asserted-by":"crossref","unstructured":"Arumugam, S., Froncek, D., Kamatchi, N.: Distance magic graphs\u2014a survey. J. Indonesian Math. Soc., Special Edition, 11\u201326. http:\/\/www.jims-a.org\/index.php\/jimsa\/issue\/archive (2011)","DOI":"10.22342\/jims.0.0.15.11-26"},{"key":"1453_CR3","unstructured":"Cichacz, S.: Distance magic $$(r, t)$$ ( r , t ) -hypercycles. Utilitas Math. (2013) (accepted)"},{"key":"1453_CR4","first-page":"349","volume":"78","author":"D Froncek","year":"2011","unstructured":"Froncek, D., Kov\u00e1\u0159, P., Kov\u00e1\u0159ov\u00e1, T.: Constructing distance magic graphs from regular graphs. J. Combin. Math. Combin. Comput. 78, 349\u2013354 (2011)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"1453_CR5","unstructured":"Gallian, J.A.: A dynamic survey of graph labeling. Elec. J. Combin. DS6, 16th edn. http:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/DS6\/pdf (2013)"},{"key":"1453_CR6","first-page":"22","volume-title":"Graph Theory","author":"F Harary","year":"1994","unstructured":"Harary, F.: Graph Theory, p. 22. Addison-Wesley, Reading (1994)"},{"key":"1453_CR7","unstructured":"Imrich, W., Klav\u017ear, S.: Product Graphs. Wiley-Interscience, New York (2000)"},{"key":"1453_CR8","unstructured":"Jinnah, M.I.: On $$\\Sigma $$ \u03a3 -labelled graphs. In: Acharya, B.D., Hedge, S.M. (eds) Technical Proceedings of Group Discussion on Graph Labeling Problems, pp. 71\u201377 (1999)"},{"key":"1453_CR9","first-page":"305","volume":"28","author":"M Miller","year":"2003","unstructured":"Miller, M., Rodger, C., Simanjuntak, R.: Distance magic labelings of graphs. Aust. J. Comb. 28, 305\u2013315 (2003)","journal-title":"Aust. J. Comb."},{"key":"1453_CR10","unstructured":"Rao, S.B.: Sigma graphs\u2014a survey. In: Acharya, B.D., Arumugam, S., Rosa, A. (eds) Labelings of Discrete Structures and Applications, pp. 135\u2013140. Narosa Publishing House, New Delhi (2008)"},{"key":"1453_CR11","unstructured":"Rao, S.B., Singh, T., Parameswaran, V.: Some Sigma labelled graphs I. In: Arumugam, S., Acharya, B.D., Rao, S.B. (eds) Graphs, Combinatorics, Algorithms and Applications, pp. 125\u2013133. Narosa Publishing House, New Delhi (2004)"},{"key":"1453_CR12","unstructured":"Shafiq, M.K., Ali, G., Simanjuntak, R.: Distance magic labelings of a union of graphs. AKCE J. Graphs Combin. 6(1), 191\u2013200 (2009)"},{"key":"1453_CR13","unstructured":"Vilfred, V.: $$\\Sigma $$ \u03a3 -labelled graph and circulant graphs. Ph.D. Thesis, University of Kerala, Trivandrum, India (1994)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1453-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1453-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1453-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T22:42:30Z","timestamp":1649025750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1453-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,22]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["1453"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1453-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,22]]}}}