< Back to previous view
Sign in

Hexagonal capping of symmetric cubic graphs

Last update: 22 Dec 2015  | Contains: 284 graphs

Hexagonal capping HC(G) has four vertices {u0, v0},{u0, v1},{u1, v0},{u1, v1} for each edge {u,v} of G, and each {u_i, v_j} is joined to each {v_j, w_(1-i)}, where u and w are distinct neighbors of v in G. The collection includes hexagonal capping of cubic symmetric graphs up to 798 vertices.

Collection comments

Only signed in users can post comments. Sign in here
Don't have an account yet? Register here