These differences are interesting. I expect graph-tool to become faster
if the graphs become larger (your graphs are very small).
Networkx compares the degree sequence (and the vertex invariants) before
running the actual isomorphism code. This is a shortcut that improves
things if the graphs are clearly not isomorphic. Do you know if this is
the case for your graphs?
What happens to the time difference if all the graphs tested are
isomorphic?
I can easily implement these shortcuts in graph-tool as well, if they
happen to be the source of the discrepancy.