{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:28:40Z","timestamp":1648618120634},"reference-count":13,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2015,3]]},"abstract":"<jats:p> A vertex-deleted subgraph of a graph G is called a card of G. A card of G with which the degree of the deleted vertex is also given is called a degree associated card or dacard of G. The adversary degree associated reconstruction number of a graph G, adrn (G), is the minimum number k such that every collection of k dacards of G uniquely determines G. We prove that adrn (G) = 1 + min {t+1, m-t} or 1 + min {t, m - t + 2} for a graph G obtained by subdividing t edges of K<jats:sub>1, m<\/jats:sub>. We also prove that if G is a nonempty disconnected graph whose components are cycles or complete graphs, then adrn (G) is 3 or 4, while, if G is a double star whose central vertices have degrees m + 1 and n + 1(m &gt; n \u2265 2), then adrn (G) can be as large as n + 3. <\/jats:p>","DOI":"10.1142\/s1793830914500694","type":"journal-article","created":{"date-parts":[[2014,9,18]],"date-time":"2014-09-18T21:08:35Z","timestamp":1411074515000},"page":"1450069","source":"Crossref","is-referenced-by-count":4,"title":["Adversary degree associated reconstruction number of graphs"],"prefix":"10.1142","volume":"07","author":[{"given":"S.","family":"Monikandan","sequence":"first","affiliation":[{"name":"Department of Mathematics, Manonmaniam Sundaranar University, Tirunelveli 627 012, Tamil Nadu, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Sundar Raj","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Vivekananda College, Capecomorin 629 701, Tamil Nadu, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2015,2,2]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2010.03.037"},{"key":"rf2","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"Harary F.","year":"1969"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1093\/qmath\/39.1.47"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090403"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35926-2_12"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/808105"},{"key":"rf8","first-page":"123","volume":"28","author":"Myrvold W. J.","year":"1989","journal-title":"Ars Combin."},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190140203"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(81)80019-6"},{"key":"rf11","first-page":"41","volume":"1","author":"Ramachandran S.","year":"2000","journal-title":"Mano. Int. J. Math. Sci."},{"key":"rf12","first-page":"289","volume":"78","author":"Ramachandran S.","year":"2006","journal-title":"Ars Combin."},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190010108"},{"key":"rf14","unstructured":"S. M.\u00a0Ulam, A Collection of Mathematical Problems (Wiley, New York, 1960)\u00a0p. 29."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830914500694","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:25:28Z","timestamp":1565137528000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830914500694"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,2]]},"references-count":13,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2015,2,2]]},"published-print":{"date-parts":[[2015,3]]}},"alternative-id":["10.1142\/S1793830914500694"],"URL":"https:\/\/doi.org\/10.1142\/s1793830914500694","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,2]]}}}