A Note on the Adversary Degree Associated Reconstruction Number of Graphs
Joint Authors
Jayasekaran, C.
Sundar Raj, S.
Monikandan, S.
Santhakumaran, A. P.
Source
Journal of Discrete Mathematics
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-5, 5 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-03-31
Country of Publication
Egypt
No. of Pages
5
Main Subjects
Information Technology and Computer Science
Abstract EN
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 degree associated reconstruction number drn (G) of a graph G is the size of the smallest collection of dacards of G that uniquely determines 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 that uniquely determines G.
In this paper, we show that adrn of wheels and complete bipartite graphs on at least 4 vertices is 2 or 3.
American Psychological Association (APA)
Monikandan, S.& Sundar Raj, S.& Jayasekaran, C.& Santhakumaran, A. P.. 2013. A Note on the Adversary Degree Associated Reconstruction Number of Graphs. Journal of Discrete Mathematics،Vol. 2013, no. 2013, pp.1-5.
https://search.emarefa.net/detail/BIM-499711
Modern Language Association (MLA)
Monikandan, S.…[et al.]. A Note on the Adversary Degree Associated Reconstruction Number of Graphs. Journal of Discrete Mathematics No. 2013 (2013), pp.1-5.
https://search.emarefa.net/detail/BIM-499711
American Medical Association (AMA)
Monikandan, S.& Sundar Raj, S.& Jayasekaran, C.& Santhakumaran, A. P.. A Note on the Adversary Degree Associated Reconstruction Number of Graphs. Journal of Discrete Mathematics. 2013. Vol. 2013, no. 2013, pp.1-5.
https://search.emarefa.net/detail/BIM-499711
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-499711
