The automorphism group of a hypercube

Journal of Universal Computer Science

Volumn 6, Issue 1, 2000, Pages 136-138

  Harary, Frank ^a,b  

^a University of Missouri Rolla   (United States)

^b New Mexico State University   (United States)

Author keywords

Automorphism group; Hypercube; Permutation graph

Indexed keywords

EID: 27644434549     PISSN: 0948695X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. R. Frucht, On the groups of repeated graphs, Bull. Amer. Math. Soc. 55 (1949) 418-520.
2. F. Harary, On the number of bi-colored graphs, Pacific J. Math. 8 (1958) 743-755.
3. F. Harary, Exponentiation of permutation groups, Amer. Math. Monthly 66 (1959) 572-575.
4. F. Harary, Graph Theory, Addison-Wesley, Reading (1969) p. 164.
5. F. Harary, Presentations of a hypercube, Proceedings of the First Hong Kong Conference on Artificial Intelligence (1988).
6. F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, New York, 1973.
7. E. M. Palmer, The exponential group as the automorphism group of a graph, in Proof Techniques in Graph Theory (F. Harary, ed.) Academic Press, New York, 1969, 125-131.
8. E. M. Palmer and R. W. Robinson, Enumeration under two representations of the wreath product, Acta Mathematica 131 (1973) 123-143.
9. G. Polya, Kombinatorische Anazahlbestimmungen für Gruppen, Graphen und chemische Verbindungen, Acta Math. 68 (1937) 145-253.
10. G. Polya, Sur les types des propositions composées, J. Symbolic Logic 5 (1940) 98-103.
11. D. Slepian, On the number of symmetry types of Boolean functions of n variables, Canad. J. Math. 5 (1953) 185-193.