Upper bounds on the automorphism group of a graph

Discrete Mathematics

Volumn 256, Issue 1-2, 2002, Pages 489-493

  Krasikov, Ilia ^a   Lev, Arieh ^b   Thatte, Bhalchandra D ^c  

^a BRUNEL UNIVERSITY   (United Kingdom)

^b ACADEMIC COLLEGE OF TEL AVIV YAFFO   (Israel)

^c NONE   (United States)

Author keywords

Automorphism group

Indexed keywords

EID: 33750992204     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00393-X     Document Type: Article

References (12)

1. D. Barnette, Trees in polytopal graphs, Canad. J. Math. 18 (1966) 731-736.
2. J.A. Bondy, The Reconstruction of Graphs, Department of Combinatorics and Optimization, University of Waterloo, 1983, preprint.
3. J.A. Bondy, A graph reconstructor's manual, in: Surveys in Combinatorics, London Mathematical Society Lecture Note Series, Vol. 166, Cambridge University Press, Cambridge, 1991, pp. 221-252.
4. Y. Caro, I. Krasikov, Y. Roditty, Spanning trees and some edge-reconstructible graphs, Ars Combin. A 20 (1985) 109-118.
5. Y. Caro, I. Krasikov, Y. Roditty, On the largest subtree of a given maximum degree in connected graphs, J. Graph Theory 15 (1991) 7-13.
6. J. Caunter, C.St.J.A. Nash-Williams, Degree Conditions for Edge Reconstruction, 1982, manuscript.
7. M.N. Ellingham, Recent progress in edge reconstruction, Congr. Numer. 62 (1988) 3-20.
8. S. Fiorini, J. Lauri, Edge reconstruction of graphs with topological properties, in: Combinatorial Mathematics (Marseille-Luminy, 1981), North-Holland Math. Studies, Vol. 75, North-Holland, Amsterdam, New York, 1983, pp. 285-288.
9. 1,m-free graphs, J. Combin. Theory B 49(2) (1990) 295-298.
10. I. Krasikov, Y. Roditty, Recent applications of Nash-Williams lemma to the edge-reconstruction conjecture, Ars Combin. A 29 (1990) 215-224.
11. L. Lovász, Some Problems of Graph Theory, Matematikus Kurir, 1983.
12. L. Pyber, The edge reconstruction of hamiltonian graphs, J. Graph Theory 14 (1990) 173-179.