Graphs with Given Group and Given Graph-Theoretical Properties

1957/01/01 by Gert Sabidussi · 228 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Finite Group Theory Research #Graph theory and applications #Mathematics #Graph #Group (periodic table) #Combinatorics #Pure mathematics

paper · pdf · doi:10.4153/cjm-1957-060-7

published in Canadian Journal of Mathematics 9, 515-525 (Cambridge University Press)

openalex publication_date 1957/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04

Abstract

n 1938 Frucht (2) proved the following theorem: (1.1). Theorem. Given any finite group G there exist infinitely many nonisomorphic connected graphs X whose automorphism group is isomorphic to G.

Citations

• Congruent Graphs and the Connectivity of Graphs

Cited by

• Coloring graph products — A survey
• Cartesian product of graphs [wikipedia]
• Hedetniemi's conjecture [wikipedia]