Cycle embedding of augmented cubes

A graph G=(V,E) is vertex-pancyclic if for every vertex u and any integer l ranging from a positive constant L to |V|, G contains a cycle C of length l such that u is in C. In this paper, we show that an n-dimensional augmented cube, where n⩾2, is vertex-pancyclic with L=3.