In this article, we introduce three families of subgroups of the fundamental group of graphs that indicate the presence of cycles of a specific length. We examine the interconnection between these families, such as their normality and their behavior with respect to the common homomorphisms between the fundamental groups of graphs. Ultimately we demonstrate that there is a finite length depended on the diameter of graph, after which all of these subgroups are equal to the fundamental group of graph.
