Graphs with constant link and small degree or order

The graph G has constant link L if for each vertex x of G the graph induced by G on the vertices adjacent to x is isomorphic to L. For each graph L on 6 or fewer vertices we decide whether or not there exists a graph G with constant link L. From this we are able to list all graphs on 11 or fewer vertices which have constant link.