Bounds on the Complete Forcing Number of Graphs
<|reference_start|>Bounds on the Complete Forcing Number of Graphs: 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 complete forcing set for a graph is a subset of its edges, such that it intersects the edges of every perfect matching in a forcing set of that perfect matching. The size of a smallest complete forcing set of a graph is called the complete forcing number of the graph. In this paper, we derive new upper bounds for the complete forcing number of graphs in terms of other graph theoretical parameters such as the degeneracy or the spectral radius of the graph. We show that for graphs with the number of edges more than some constant times the number of vertices, our result outperforms the best known upper bound for the complete forcing number. For the set of edge-transitive graphs, we present a lower bound for the complete forcing number in terms of maximum forcing number. This result in particular is applied to the hypercube graphs and Cartesian powers of even cycles.<|reference_end|>
@article{ebrahimi2024bounds,
    title={Bounds on the Complete Forcing Number of Graphs},
    author={Javad B. Ebrahimi and Aref Nemayande and Elahe Tohidi},
    journal={arXiv preprint arXiv:2409.17306},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.17306},
    primaryClass={math.CO cs.DM}
}