Bounds on the Complete Forcing Number of Graphs

Javad B. Ebrahimi, Aref Nemayande, Elahe Tohidi

A forcing set for a perfect matching of a graph is defined as a subset of the edges of that perfect matching such that there exists a unique perfect matching containing it. A compl…