Yes,
Theorem:-> A directed graph has a cycle iff DFS reveals a back edge.
Means if there is cycle then there is compulsory back edge in DFS of G and vice versa.
So here as per ur question by removing 1 edge it becomes acyclic so, then definitely we encounter a Back edge when we do DFS of G.
U may take any no. of examples and cross verify it.