We consider the problem of testing asymmetry in the bounded-degree graph model, where a graph is called asymmetric if the identity permutation is its only automorphism. Seeking to determine the query complexity of this testing problem, we provide two partial results. In addition, we show that testing asymmetry in the dense graph model is almost trivial, because (in this model) every graph is close to being asymmetric.