Degree-associated reconstruction number of graphs

Discrete Mathematics

Volumn 310, Issue 20, 2010, Pages 2600-2612

  Barrus, Michael D ^a   West, Douglas B ^b  

^a BLACK HILLS STATE UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Caterpillar; Reconstruction conjecture; Reconstruction number; Tree; Vertex transitive graph

Indexed keywords

GRAPH G; MULTISET; N-VERTEX GRAPH; SUBGRAPHS; SUFFICIENT CONDITIONS;

GRAPHIC METHODS; REPAIR; TREES (MATHEMATICS);

GRAPH THEORY;

EID: 77955555753     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2010.03.037     Document Type: Article

References (24)

1. K.J. Asciak, and J. Lauri On disconnected graph with large reconstruction number Ars Combin. 62 2002 173 181
2. B. Bollobs Almost every graph has reconstruction number three J. Graph Theory 14 1990 1 4
3. J.A. Bondy A graph reconstructor's manual Surveys in Combinatorics (Guildford, 1991) Lond. Math. Soc. Lec. Notes vol. 166 1991 Cambridge U. Press 221 252
4. J.A. Bondy, and R.L. Hemminger Graph reconstructiona survey J. Graph Theory 1 1977 227 268
5. F. Harary, and J. Lauri On the class-reconstruction number of trees Q. J. Math. Oxford Ser. 2 39 1988 47 60
6. F. Harary, and M. Plantholt The graph reconstruction number J. Graph Theory 9 1985 451 454
7. P.J. Kelly, On isometric transformations, Ph.D. Thesis, University of WisconsinMadison, 1942.
8. P.J. Kelly A congruence theorem for trees Pacific J. Math. 7 1957 961 968
9. J. Lauri Pseudosimilarity in graphsa survey Ars Combin. 46 1997 77 95
10. A. Maccari, O. Rueda, and V. Viazzi A survey on edge reconstruction of graphs J. Discrete Math. Sci. Cryptogr. 5 2002 1 11
11. B. McMullen, and S. Radziszowski Graph reconstruction numbers J. Combin. Math. Combin. Comput. 62 2007 85 96
12. R. Molina Correction of a proof on the ally-reconstruction number of a disconnected graph Ars Combin. 40 1995 59 64
13. W. Myrvold, The ally and adversary reconstruction problems, Ph.D. Thesis, University of Waterloo, 1988.
14. W. Myrvold The ally-reconstruction number of a disconnected graph Ars Combin. 28 1989 123 127
15. W. Myrvold The ally-reconstruction number of a tree with five or more vertices is three J. Graph Theory 14 1990 149 166
16. W. Myrvold The degree sequence is reconstructible from n - 1 cards Discrete Math. 102 2 1992 187 196
17. N. Prince, Personal communication, 2008.
18. S. Ramachandran On a new digraph reconstruction conjecture J. Combin. Theory Ser. B 31 1981 143 149
19. S. Ramachandran N -reconstructibility of nonreconstructible digraphs Discrete Math. 46 1983 279 294
20. S. Ramachandran Degree associated reconstruction number of graphs and digraphs Mano. Int. J. Math. Sci. 1 2000 41 53
21. S. Ramachandran Reconstruction number for Ulam's conjecture Ars Combin. 78 2006 289 296
22. S.M. Ulam A collection of mathematical problems Interscience Tracts in Pure and Applied Mathematics, vol. 8 1960 Interscience Publishers
23. M. Welhan Reconstructing trees from two cards J. Graph Theory 33 2009 243 257
24. D.B. West Introduction to Graph Theory 2001 Prentice-Hall