To create independent edges in a graph G, this work presents a variant of the zero forcing set called the ‘edge-forcing set.’ A collection of vertices in G that can influence their neighbors to force all vertices to become forced iteratively is called a zero forcing set. If a forced vertex has exactly one unforced neighbor at any given step, it forces that neighbor to become forced as well. This concept is extended to edges by the edge-forcing set. We show that figuring out the edge-forcing number, the smallest number of vertices required to build an edge-forcing set is an NP-complete task. Additionally, for a variety of tree-like structures, we investigate the edge-forcing number, giving precise values for sibling trees and defining bounds for hypertree.