Isomorphism and Subgraphs · Challenge problem

The paw graph consists of a triangle on vertices $\{a, b, c\}$ with one pendant edge from vertex $a$ to a leaf $d$ (edges: $ab, ac, bc, ad$). How many labeled graphs on the vertex set $\{1,2,3,4\}$ are isomorphic to the paw graph?