Counting the frequency of subgraphs in large networks is a classic research question that reveals underlying substructures these for important applications. However, subgraph counting challenging problem, even sizes as small five, due to combinatorial explosion number possible occurrences. This article focuses on five-cycle, which an special case five-vertex and one most difficult count efficie...