Let R be a commutative ring with nonzero identity. We denote by AG(R)

the annihilator graph of R,whose vertex set consists of the set of nonzero zero-divisors

of R, and two distint vertices x and y are adjacent ...

A graph is traceable if it contains a Hamiltonian path. We present a connected nontraceable

cubic bipartite planar graph with 52 vertices and prove that there are no

smaller such graphs.