The existence of lattices with trivial automorphism group was shown by O'Meara, who gave an algorithm to construct such a lattice starting from any given lattice. In this process, the discriminants of the lattices increase in each step. Biermann proved the existence of a lattice…
Any finite abstract group can be realized as the automorphism group of a graph. The purpose of this memoir is to find the realization, for each finite abelian group, with the least number of vertices possible. The results are extended to all finite abelian groups. Thus a complet…
This in-depth coverage of important areas of graph theory maintains a focus on symmetry properties of graphs. Standard topics on graph automorphisms are presented early on, while in later chapters more specialised topics are tackled, such as graphical regular representations and…
This in-depth coverage of important areas of graph theory maintains a focus on symmetry properties of graphs. Standard topics on graph automorphisms are presented early on, while in later chapters more specialised topics are tackled, such as graphical regular representations and…
