## Line graphs of symmetric cubic graphs

Given a graph G, its line graph L(G) is a graph such that each vertex of L(G) represents an edge of G; and two vertices of L(G) are adjacent if and only if their corresponding edges share a common endpoint ("are incident") in G. The collection includes line graphs of cubic symmetric graphs with fewer than 768 vertices and Cayley graphs for 770-998 vertices.