{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:01:59Z","timestamp":1740096119124,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192210"},{"type":"electronic","value":"9783642192227"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19222-7_31","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T04:03:12Z","timestamp":1300075392000},"page":"303-313","source":"Crossref","is-referenced-by-count":3,"title":["On Antimagic Labeling for Generalized Web and Flower Graphs"],"prefix":"10.1007","author":[{"given":"Joe","family":"Ryan","sequence":"first","affiliation":[]},{"given":"Oudone","family":"Phanalasy","sequence":"additional","affiliation":[]},{"given":"Mirka","family":"Miller","sequence":"additional","affiliation":[]},{"given":"Leanne","family":"Rylands","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","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. BrownWalker Press, Boca Raton (2008)"},{"issue":"24","key":"31_CR2","doi-asserted-by":"publisher","first-page":"6441","DOI":"10.1016\/j.disc.2007.12.032","volume":"308","author":"Y. Cheng","year":"2008","unstructured":"Cheng, Y.: A new class of antimagic Cartesian product graphs. Discrete Math.\u00a0308(24), 6441\u20136448 (2008), \n                  \n                    http:\/\/dx.doi.org\/10.1016\/j.disc.2007.12.032","journal-title":"Discrete Math."},{"issue":"3","key":"31_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/jgt.20347","volume":"60","author":"D.W. Cranston","year":"2009","unstructured":"Cranston, D.W.: Regular bipartite graphs are antimagic. J. Graph Theory\u00a060(3), 173\u2013182 (2009), \n                  \n                    http:\/\/dx.doi.org\/10.1002\/jgt.20347","journal-title":"J. Graph Theory"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0021-9800(69)80011-6","volume":"7","author":"T.J. Dickson","year":"1969","unstructured":"Dickson, T.J.: On a problem concerning separating systems of a finite set. J. Combinatorial Theory\u00a07, 191\u2013196 (1969)","journal-title":"J. Combinatorial Theory"},{"key":"31_CR5","unstructured":"Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Combin. 16(\n                  \n                    \n                  \n                  $\\sharp$\n                DS6) (2009)"},{"key":"31_CR6","volume-title":"Pearls in graph theory: a comprehensive introduction","author":"N. Hartsfield","year":"1990","unstructured":"Hartsfield, N., Ringel, G.: Pearls in graph theory: a comprehensive introduction. Academic Press Inc., Boston (1990)"},{"key":"31_CR7","unstructured":"Phanalasy, O., Miller, M., Iliopoulos, C.S., Pissis, S.P., Vaezpour, E.: Construction of antimagic labeling for the Cartesian product of regular graphs (preprint)"},{"key":"31_CR8","unstructured":"Phanalasy, O., Miller, M., Rylands, L., Lieby, P.: On a relationship between completely separating systems and antimagic labeling of regular graphs (submitted)"},{"key":"31_CR9","first-page":"75","volume":"22","author":"A. R\u00e9nyi","year":"1961","unstructured":"R\u00e9nyi, A.: On random generating elements of a finite Boolean algebra. Acta Sci. Math. Szeged\u00a022, 75\u201381 (1961)","journal-title":"Acta Sci. Math. Szeged"},{"key":"31_CR10","unstructured":"Roberts, I.T.: Extremal Problems and Designs on Finite Sets. Ph.D. thesis, Curtin University of Technology (1999)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:29:26Z","timestamp":1558420166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}