  Given a graph $G$, a total labeling on $G$ is called edge-antimagic total
(respectively, vertex-antimagic total) if all edge-weights (respectively,
vertex-weights) are pairwise distinct. If a labeling on $G$ is simultaneously
edge-antimagic total and vertex-antimagic total, it is called a totally
antimagic total labeling. A graph that admits totally antimagic total labeling
is called a totally antimagic total graph. In this paper, we prove that
ladders, prisms and generalised Pertersen graphs are totally antimagic total
graphs. We also show that the chain graph of totally antimagic total graphs is
a totally antimagic total graph.
