{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T11:51:18Z","timestamp":1771329078695,"version":"3.50.1"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T00:00:00Z","timestamp":1196467200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2007,12]]},"DOI":"10.1007\/s00373-007-0748-6","type":"journal-article","created":{"date-parts":[[2007,12,8]],"date-time":"2007-12-08T05:58:30Z","timestamp":1197093510000},"page":"681-689","source":"Crossref","is-referenced-by-count":4,"title":["Characterization of Product Anti-Magic Graphs of Large Order"],"prefix":"10.1007","volume":"23","author":[{"given":"Oleg","family":"Pikhurko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"748_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Kaplan, G., Lev, A., Roditty, Y., Yuster, R.: Dense graphs are antimagic, J. Graph Theory 47, 297\u2013309 (2004)","DOI":"10.1002\/jgt.20027"},{"key":"748_CR2","unstructured":"Bohman, T., Frieze, A., \u0141uczak, T., Pikhurko, O., Smyth, C., Spencer, J.H., Verbitsky, O.: First order definability of trees and sparse random structures, Combin. Prob. Computing 16, 375\u2013400 (2007)"},{"key":"748_CR3","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory, Springer, Berlin, 1998","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"748_CR4","unstructured":"Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Statistics 23, 493\u2013507 (1952)"},{"key":"748_CR5","unstructured":"Figueroa-Centeno, R.M., Ichishima, R., Muntaner-Batle, F.A.: Bertrand\u2019s postulate and magical product labelings, Bull. ICA 30, 53\u201365 (2000)"},{"key":"748_CR6","unstructured":"Gallian, J.A.: A dynamic survey of graph labeling, Electronic J. Combin. DS6, 148 (2005)"},{"key":"748_CR7","unstructured":"Hartsfield, H., Ringel, G.: Pearls in Graph Theory, Academic, New york, 1990"},{"key":"748_CR8","unstructured":"Kaplan, G., Lev, A., Roditty, Y.: Bertrand Postulate, the Prime Number Theorem, and product anti-magic graphs, Talk presented at the 20th British Combinatorial Conference, 2005"},{"key":"748_CR9","unstructured":"Kim, J.H., Pikhurko, O., Spencer, J., Verbitsky, O.: How complex are random graphs in first order logic? Random Struct. Algorithms 26, 119\u2013145 (2005)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0748-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-007-0748-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0748-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:27Z","timestamp":1559055507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-007-0748-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["748"],"URL":"https:\/\/doi.org\/10.1007\/s00373-007-0748-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12]]}}}