R. Foster: Geometrical circuits of electrical networks.
Trans. AIEE 51 (1932), 309-317. This paper initiated the study
of symmetric graphs.

R. Frucht: Die Gruppe des Petersenschen Graphen und der Kantensysteme
der regula''ren Polyeder. Comm. Math. Helv. 9 (1937), 217-223.

R. Frucht: Herstellung von Graphen mit vorgegebener abstrakter Gruppe.
Compositio Math, 6 (1938), 239-250.

R. Frucht: Graphs of degree three with a given abstract group.
Can. J. Math. 1 (1949), 365-378.

R. Frucht: On the groups of repeated graphs.
Bull. AMS 55 (1949), 418-420.

R. Frucht/Frank Harary: On the corona of two graphs.
Aequationes Math. ... (ca. 1969), ...

Frank Harary: On the group of the composition of two graphs.
Duke Math. J. 26 (1959), 29-34.

Frank Harary/E. Palmer: The smallest graph whose group is cyclic.
Czech. Math. J. 16 (1966), 70-71.

Frank Harary/E. Palmer: On the group of a composite graph.
Studia Sci. Math. Hungar. 3 (ca. 1969), ...

H. Izbicki: Unendliche Graphen endlichen Graphen mit vorgegebenen
Eigenschaften. Monatshefte Math. 63 (1959), 298-301.

20422 William Kantor: Cycles in graphs and groups.
Am. Math. Monthly June 2008, 559-562.

G. Sabidussi: Loewy-groupoids related to linear graphs.
Am. J. Math. 76 (1954), 447-487.

G. Sabidussi: On the minimum order of graphs with a given automorphism
group. Monatshefte Math. 63 (1959), 124-127.

G. Sabidussi: Graph multiplication.
Math. Zeitschr. 72 (1960), 446-457.

W. Tutte: The connectivity of graphs. Toronto UP 1967.