3 papers
cs.DC2025
Survey on Token-Based Distributed MutualExclusion Algorithms
Elahe Tohidi, Seyed Sattar Lotfi Fatemi
In large-scale distributed environments, avoiding concurrent access to the same resource by multiple processes becomes a core challenge, commonly termed distributed mutual exclusio…
math.CO2024
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…
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 exc…