Table of Contents
Journal of Discrete Mathematics
Volume 2013, Article ID 808105, 5 pages
Research Article

A Note on the Adversary Degree Associated Reconstruction Number of Graphs

1Department of Mathematics, Manonmaniam Sundaranar University, Tirunelveli 627 012, India
2Department of Mathematics, Vivekananda College, Agasteeswaram 629 701, India
3Department of Mathematics, Pioneer Kumaraswamy College, Nagercoil 629 003, India
4Department of Mathematics, Hindustan Institute of Technology and Science, Hindustan University, Chennai 103, India

Received 8 November 2012; Accepted 14 March 2013

Academic Editor: Leonidas Palios

Copyright © 2013 S. Monikandan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


A vertex-deleted subgraph of a graph is called a card of . A card of with which the degree of the deleted vertex is also given is called a degree associated card (or dacard) of . The degree associated reconstruction number drn () of a graph is the size of the smallest collection of dacards of that uniquely determines . The adversary degree associated reconstruction number of a graph , adrn(), is the minimum number such that every collection of dacards of that uniquely determines . In this paper, we show that adrn of wheels and complete bipartite graphs on at least 4 vertices is 2 or 3.