A paired dominating set P is a dominating set with the additional proper...
Given a graph G=(V(G), E(G)), the size of a minimum dominating set, mini...
The independence gap of a graph was introduced by Ekim et al. (2018) as ...
The concept of Reload cost in a graph refers to the cost that occurs whi...
A graph is called equimatchable if all of its maximal matchings have the...
We study graphs in which the maximum and the minimum sizes of a maximal
...