8 citations · 14 across the 3 of their papers we have counts for
1 paper · 1 filter
Steve Lawford
For a simple undirected graph G, we derive exact formulae for the number of copies of each of the 21 non-isomorphic connected graphs on five vertices. For nine of these graphs (t…