1 citations · 2 across the 2 of their papers we have counts for
2 papers
math.CO2024★ 1 cited
Bounds on the Complete Forcing Numbers of Graphs
Javad B. Ebrahimi, Aref Nemayande, Aref Namayandeh +1
A complete forcing set of a graph is a subset of its edges with the following property. For any perfect matching , is the unique perfect matching containing the intersec…
math.CO2020★ 1 cited
Fractional forcing number of graphs
Javad B. Ebrahimi, Babak Ghanbari
The notion of forcing sets for perfect matchings was introduced by Harary, Klein, and Živković. The application of this problem in chemistry, as well as its interesting theoretical…