A homomorphism from one graph to another is a mapping that sends vertices to vertices and edges to edges. Let \(|G\to H|\) denote the number of homomorphisms from \(G\) to \(H\). For example \(|G\to K_n|\) is the number of \(n\)-colorings of \(G\). If \(\mathcal F\) is a collection of graphs, we say that \(\mathcal F\) distinguishes graphs \(G\) and \(H\) if there is \(X\in {\mathcal F}\) such that \(|G\to X|\neq |H\to X|\). \(\mathcal F\) is a distinguishing family if it distinguishes all pairs of graphs. In this note the author shows that various collections of graphs are distinguishing families.