are infinitely many asymmetric cubic graphs. The class of asymmetricgraphs is closed under complements: a graph G is asymmetric if and only if its complement
undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the
include asymmetric relations, asymmetry of shapes in geometry, asymmetricgraphs et cetera. When determining whether an object is asymmetrical, look for
Many other symmetric graphs can be classified as circulant graphs (but not all). The Rado graph forms an example of a symmetric graph with infinitely many
Paley graphs form an infinite family of conference graphs, which yield an infinite family of symmetric conference matrices. Paley graphs allow graph-theoretic