(2)-pancyclic graphs

We introduce the class of (2)-pancyclic   graphs, which are simple undirected finite connected graphs of order nn having exactly two cycles of length pp for each pp satisfying 3≤p≤n3≤p≤n, analyze their properties, and give several examples of such graphs, among which are the smallest.