1 citations · 1 across the 3 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
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.CO2024
Lower bounds for the Randić index in terms of matching number
Saieed Akbari, Sina Ghasemi Nezhad, Reyhane Ghazizadeh +2
We investigate how small the Randić index of a graph can be in terms of its matching number, and prove several results. We give best-possible linear bounds for graphs of small exce…