{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T11:51:17Z","timestamp":1771329077443,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,9,4]],"date-time":"2014-09-04T00:00:00Z","timestamp":1409788800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s11786-014-0213-x","type":"journal-article","created":{"date-parts":[[2014,9,3]],"date-time":"2014-09-03T06:01:42Z","timestamp":1409724102000},"page":"105-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Antimagicness of Generalized Corona and Snowflake Graphs"],"prefix":"10.1007","volume":"9","author":[{"given":"Jacqueline W.","family":"Daykin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mirka","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oudone","family":"Phanalasy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,9,4]]},"reference":[{"issue":"4","key":"213_CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1002\/jgt.20027","volume":"47","author":"N. Alon","year":"2004","unstructured":"Alon N., Kaplan G., Lev A., Roditty Y., Yuster R.: Dense graphs are antimagic. J. Graph Theory 47(4), 297\u2013309 (2004)","journal-title":"J. Graph Theory"},{"issue":"2","key":"213_CR2","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s10114-014-2381-7","volume":"30","author":"S. Arumugam","year":"2014","unstructured":"Arumugam S., Miller M., Phanalasy O., Ryan J.: Antimagic labeling of generalized pyramid graphs. Acta Math. Sin. (Engl. Ser.) 30(2), 283\u2013290 (2014)","journal-title":"Acta Math. Sin. (Engl. Ser.)"},{"key":"213_CR3","volume-title":"Super Edge-Antimagic Graphs: A Wealth of Problems and Some Solutions","author":"M. Ba\u010da","year":"2008","unstructured":"Ba\u010da M., Miller M.: Super Edge-Antimagic Graphs: A Wealth of Problems and Some Solutions. Brown Walker Press, Boca Raton (2008)"},{"key":"213_CR4","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1109\/PROC.1977.10517","volume":"65","author":"G.S. Bloom","year":"1977","unstructured":"Bloom G.S., Golomb S.W.: Applications of numbered undirected graphs. Proc. IEEE 65, 562\u2013570 (1977)","journal-title":"Proc. IEEE"},{"key":"213_CR5","doi-asserted-by":"crossref","unstructured":"Bloom, G.S., Golomb, S.W.: Numbered complete graphs, unusual rulers and assorted applications. In: Theory and Applications of Graphs. Lecture Notes in Mathematics, vol. 642, pp. 53\u201365. Springer, New York (1978)","DOI":"10.1007\/BFb0070364"},{"key":"213_CR6","doi-asserted-by":"crossref","unstructured":"Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Acad. Sci. Hung. 18, 25\u201366 (1967). doi: 10.1007\/BF02020961 . MR 0221974","DOI":"10.1007\/BF02020961"},{"key":"213_CR7","unstructured":"Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Combin. 19 ( $${\\sharp}$$ \u266f DS6), 1\u2013380 (2013)"},{"key":"213_CR8","unstructured":"Hartsfield, N., Ringel G.: Pearls in Graph Theory: A Comprehensive Introduction. Academic Press Inc., Boston (1990)"},{"issue":"12","key":"213_CR9","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1016\/j.parco.2010.07.002","volume":"36","author":"K.A. Hawick","year":"2010","unstructured":"Hawick K.A., Leist A., Playne D.P.: Parallel graph component labelling with GPUs and CUDA. Parallel Comput. 36(12), 655\u2013678 (2010)","journal-title":"Parallel Comput."},{"issue":"4","key":"213_CR10","doi-asserted-by":"crossref","first-page":"515","DOI":"10.15388\/Informatica.2004.076","volume":"15","author":"A. Krishnaa","year":"2004","unstructured":"Krishnaa A.: A study of the major graph labelings of trees. Informatica 15(4), 515\u2013524 (2004)","journal-title":"Informatica"},{"issue":"2","key":"213_CR11","first-page":"193","volume":"10","author":"M. Miller","year":"2013","unstructured":"Miller M., Phanalasy O., Ryan J., Rylands L.: Sparse graphs with vertex antimagic edge labelings. AKCE Int. J. Graphs Comb. 10(2), 193\u2013198 (2013)","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"213_CR12","unstructured":"O\u2019Connell, T.C.: A survey of graph algorithms in extensions to the streaming model of computation. http:\/\/www.skidmore.edu\/~toconnel\/pub\/oconnellGraphStream.pdf"},{"key":"213_CR13","first-page":"376","volume":"8288","author":"L. Rylands","year":"2013","unstructured":"Rylands L., Phanalasy O., Ryan J., Miller M.: An application of completely separating systems to graph labeling. LNCS 8288, 376\u2013387 (2013)","journal-title":"LNCS"},{"key":"213_CR14","doi-asserted-by":"crossref","first-page":"3624","DOI":"10.1016\/j.disc.2007.07.027","volume":"308","author":"T.M. Wang","year":"2008","unstructured":"Wang T.M., Hsiao C.C.: On anti-magic labelling for graphs. Discrete Math. 308, 3624\u20133633 (2008)","journal-title":"Discrete Math."},{"key":"213_CR15","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/j.tcs.2008.10.023","volume":"410","author":"Y. Zhang","year":"2009","unstructured":"Zhang Y., Sun X.: The antimagicness of the Cartesian product of graphs. Theor. Comput. Sci. 410, 727\u2013735 (2009)","journal-title":"Theor. Comput. Sci."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-014-0213-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-014-0213-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-014-0213-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T00:53:06Z","timestamp":1598230386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-014-0213-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,4]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["213"],"URL":"https:\/\/doi.org\/10.1007\/s11786-014-0213-x","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,4]]}}}