Elementary trapping sets (ETSs) are the main culprits of the performance of low-density parity-check (LDPC) codes in the error floor region. Due to their large quantities and complex structures, ETSs are difficult to analyze. This paper studies the impact of the distance between cycles on ETSs, focusing on two special graph classes: theta graphs and dumbbell graphs, which correspond to cycles with negative and non-negative distances, respectively. We determine the Turán numbers of these graphs and prove that increasing the distance between cycles can eliminate more ETSs. Additionally, using the linear state-space model and spectral theory, we prove that increasing the length of cycles or distance between cycles decreases the spectral radius of the system matrix, thereby reducing the harmfulness of ETSs. This is consistent with the conclusion obtained using Turán numbers. For specific cases when removing two 6-cycles with distance of -1, 0 and 1, respectively, we calculate the sizes, spectral radii, and error probabilities of ETSs. These results confirm that the performance of LDPC codes improves as the distance between cycles increases. Furthermore, we design the PEG-CYCLE algorithm, which greedily maximizes the distance between cycles in the Tanner graph. Numerical results show that the QC-LDPC codes constructed by our method achieve performance comparable to or even superior to state-of-the-art construction methods.