{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:42:02Z","timestamp":1742917322974,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319644189"},{"type":"electronic","value":"9783319644196"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-64419-6_4","type":"book-chapter","created":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T22:42:00Z","timestamp":1502836920000},"page":"30-37","source":"Crossref","is-referenced-by-count":0,"title":["Homometric Number of a Graph and Some Related Concepts"],"prefix":"10.1007","author":[{"given":"Anu","family":"V.","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aparna Lakshmanan","family":"S.","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,17]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.26493\/1855-3974.174.027","volume":"4","author":"MO Albertson","year":"2011","unstructured":"Albertson, M.O., Pach, J., Young, M.E.: Disjoint homometric sets in graphs. Ars Mathematica Contemporanea 4(1), 1\u20134 (2011)","journal-title":"Ars Mathematica Contemporanea"},{"key":"4_CR2","unstructured":"Aparna, L.S., Menon, M.K., Anu, V.: Homometric number of graphs (Communicated)"},{"key":"4_CR3","doi-asserted-by":"crossref","DOI":"10.1515\/9781400852000","volume-title":"The Fascinating World of Graph Theory","author":"A Benjamin","year":"2015","unstructured":"Benjamin, A., Chartrand, G., Zhang, P.: The Fascinating World of Graph Theory. Princeton University Press, Princeton (2015)"},{"key":"4_CR4","first-page":"175","volume":"55","author":"M Axenovich","year":"2013","unstructured":"Axenovich, M., \u00d6zkahya, L.: On homometric sets in graphs. Australas. J. Combin. 55, 175\u2013187 (2013)","journal-title":"Australas. J. Combin."},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/j.ejc.2014.01.007","volume":"39","author":"M Axenovich","year":"2014","unstructured":"Axenovich, M., Martin, R., Ueckerdt, T.: Twins in graphs. Eur. J. Comb. 39, 188\u2013197 (2014)","journal-title":"Eur. J. Comb."},{"key":"4_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8505-7","volume-title":"A Textbook of Graph Theory","author":"R Balakrishnan","year":"2000","unstructured":"Balakrishnan, R., Ranganathan, K.: A Textbook of Graph Theory. Springer, New York (2000)"},{"issue":"3","key":"4_CR7","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"DG Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discret. Appl. Math. 3(3), 163\u2013174 (1981)","journal-title":"Discret. Appl. Math."},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/j.ejc.2013.06.008","volume":"35","author":"R Fulek","year":"2014","unstructured":"Fulek, R., Mitrovi\u0107, S.: Homometric sets in trees. Eur. J. Comb. 35, 256\u2013263 (2014)","journal-title":"Eur. J. Comb."},{"key":"4_CR9","doi-asserted-by":"crossref","DOI":"10.1201\/b10959","volume-title":"Handbook of Product Graphs","author":"R Hammack","year":"2011","unstructured":"Hammack, R., Imrich, W., Klav\u017ear, S.: Handbook of Product Graphs. CRC Press, Boca Raton (2011)"},{"key":"4_CR10","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-55566-4_27","volume-title":"Discrete and Computational Geometry","author":"P Lemke","year":"2003","unstructured":"Lemke, P., Skiena, S.S., Smith, W.D.: Reconstructing sets from interpoint distances. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds.) Discrete and Computational Geometry. Algorithms and Combinatorics, vol. 25, pp. 507\u2013631. Springer, Heidelberg (2003). doi: 10.1007\/978-3-642-55566-4_27"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"1933","DOI":"10.1016\/j.ejc.2008.01.013","volume":"29","author":"M Senechal","year":"2008","unstructured":"Senechal, M.: A point set puzzle revisited. Eur. J. Comb. 29, 1933\u20131944 (2008)","journal-title":"Eur. J. Comb."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science and Discrete Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64419-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T08:38:43Z","timestamp":1570005523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-64419-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319644189","9783319644196"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64419-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}