{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:21:27Z","timestamp":1742916087444,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"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_1","type":"book-chapter","created":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T22:42:00Z","timestamp":1502836920000},"page":"1-9","source":"Crossref","is-referenced-by-count":0,"title":["Degree Associated Reconstruction Number of Biregular Bipartite Graphs Whose Degrees Differ by at Least Two"],"prefix":"10.1007","author":[{"given":"A.","family":"Anu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Monikandan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,17]]},"reference":[{"issue":"4","key":"1_CR1","first-page":"1650068-1","volume":"8","author":"A Anu","year":"2016","unstructured":"Anu, A., Monikandan, S.: Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree $$n-2$$ n - 2 . Discrete Math. Algorithms Appl. 8(4), 1650068-1\u20131650068-13 (2016)","journal-title":"Discrete Math. Algorithms Appl."},{"key":"1_CR2","unstructured":"Anusha Devi, P., Monikandan, S.: Degree associated reconstruction number of graphs with regular pruned graph. Ars Combin. (to appear)"},{"issue":"3","key":"1_CR3","first-page":"365","volume":"66","author":"P Anusha Devi","year":"2016","unstructured":"Anusha Devi, P., Monikandan, S.: Degree associated reconstruction number of connected digraphs with unique end vertex. Australas. J. Combin. 66(3), 365\u2013377 (2016)","journal-title":"Australas. J. Combin."},{"key":"1_CR4","first-page":"443","volume":"97","author":"KJ Asciak","year":"2010","unstructured":"Asciak, K.J., Francalanza, M.A., Lauri, J., Myrvold, W.: A survey of some open questions in reconstruction numbers. Ars Combin. 97, 443\u2013456 (2010)","journal-title":"Ars Combin."},{"key":"1_CR5","doi-asserted-by":"crossref","first-page":"2600","DOI":"10.1016\/j.disc.2010.03.037","volume":"310","author":"MD Barrus","year":"2010","unstructured":"Barrus, M.D., West, D.B.: Degree-associated reconstruction number of graphs. Discrete Math. 310, 2600\u20132612 (2010)","journal-title":"Discrete Math."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Bondy, J.A.: A graph reconstructors manual, in Surveys in Combinatorics. In: Proceedings of 13th British Combinatorial Conference London Mathematical Society, Lecture Note Series, vol. 166, pp. 221\u2013252 (1991)","DOI":"10.1017\/CBO9780511666216.009"},{"key":"1_CR7","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Addison Wesley, Reading (1969)"},{"key":"1_CR8","first-page":"47","volume-title":"Theory of Graphs and its Applications","author":"F Harary","year":"1964","unstructured":"Harary, F.: On the reconstruction of a graph from a collection of subgraphs. In: Fieldler, M. (ed.) Theory of Graphs and its Applications, pp. 47\u201352. Academic Press, New York (1964)"},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1002\/jgt.3190090403","volume":"9","author":"F Harary","year":"1985","unstructured":"Harary, F., Plantholt, M.: The graph reconstruction number. J. Graph Theory 9, 451\u2013454 (1985)","journal-title":"J. Graph Theory"},{"key":"1_CR10","unstructured":"Kelly, P.J.: On isometric transformations. Ph.D. Thesis, University of Wisconsin Madison (1942)"},{"issue":"4","key":"1_CR11","doi-asserted-by":"crossref","first-page":"1271","DOI":"10.11650\/tjm.19.2015.4850","volume":"19","author":"M Ma","year":"2015","unstructured":"Ma, M., Shi, H., Spinoza, H., West, D.B.: Degree-associated reconstruction parameters of complete multipartite graphs and their complements. Taiwanese J. Math. 19(4), 1271\u20131284 (2015)","journal-title":"Taiwanese J. Math."},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0095-8956(81)80019-6","volume":"31","author":"S Ramachandran","year":"1981","unstructured":"Ramachandran, S.: On a new digraph reconstruction conjecture. J. Combin. Theory Ser. B. 31, 143\u2013149 (1981)","journal-title":"J. Combin. Theory Ser. B."},{"key":"1_CR13","first-page":"41","volume":"1","author":"S Ramachandran","year":"2000","unstructured":"Ramachandran, S.: Degree associated reconstruction number of graphs and digraphs. Mano. Int. J. Math. Scis. 1, 41\u201353 (2000)","journal-title":"Mano. Int. J. Math. Scis."},{"key":"1_CR14","unstructured":"Spinoza, H.: Degree-associated reconstruction parameters of some families of trees (2014). (submitted)"},{"key":"1_CR15","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/jgt.3190010108","volume":"1","author":"PK Stockmeyer","year":"1977","unstructured":"Stockmeyer, P.K.: The falsity of the reconstruction conjecture for tournaments. J. Graph Theory. 1, 19\u201325 (1977)","journal-title":"J. Graph Theory."},{"key":"1_CR16","series-title":"Interscience Tracts in Pure and Applied Mathematics 8","volume-title":"A Collection of Mathematical Problems","author":"SM Ulam","year":"1960","unstructured":"Ulam, S.M.: A Collection of Mathematical Problems. Interscience Tracts in Pure and Applied Mathematics 8. Interscience Publishers, New York (1960)"}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T08:38:45Z","timestamp":1570005525000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-64419-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319644189","9783319644196"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64419-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}