Reconstruction number for Ulam's conjecture

Ars Combinatoria

Volumn 78, Issue , 2006, Pages 289-296

  Ramachandran, S ^a  

^a Vivekananda College   (India)

Author keywords

Dacard; Degree associated reconstruction; Ulam's conjecture

Indexed keywords

EID: 33644665648     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. F.Harary, On the reconstruction of a graph from a collection of subgraphs. Theory of Graphs and its Applications, (M.Fiedler ed.) Academic press, New York (1964) 47-52.
2. F.Harary, Graph Theory, Addison Wesley, Mass. 1969.
3. F.Harary and M.Plantholt, The graph reconstruction number, J. Graph Theory 9(1985) 451-454.
4. B.Manvel, Reconstructing the degree-pair sequence of a digraph, J.Combitorial Theory (B) 15 (1973), 18-31.
5. R.Molina, Correction of a proof on the ally-reconstruction number of a disconnected graph, Ars Combinatoria 40 (1995)59-64.
6. W.J.Myrvold, The ally-reconstruction number of a disconnected graph, Ars Combinatoria 28(1989) 123-127.
7. S.Ramachandran, On a new digraph reconstruction conjecture, J. Combin. Theory B 31(1981) 143-149.
8. S.Ramachandran, N-reconstruction of nonreconstructible digraphs, Discrete Math. 46(1983) 279-294.
9. S.Ramachandran, Degree associated reconstruction number of graphs and digraphs, Mano. Int. Journal of Mathematical Sciences, 1(2000) 41-53.
10. P.K.Stockmeyer, The falsity of the reconstruction conjecture for tournaments, J. Graph Theory, 1(1977) 19-25.
11. P.K.Stockmeyer, A census of nonreconstructible digraphs I: Six related families, J. Combin. Theory B 31(1981) 232-239.