6 papers
Upper paired domination versus upper domination
Hadi Alizadeh, Didem Gözüpek
A paired dominating set is a dominating set with the additional property that has a perfect matching. While the maximum cardainality of a minimal dominating set in a graph…
Triangle-Free Equimatchable Graphs
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan
A graph is called equimatchable if all of its maximal matchings have the same size. Frendrup et al. [8] provided a characterization of equimatchable graphs with girth at least .…
On Almost Well-Covered Graphs of Girth at Least 6
Tınaz Ekim, Didem Gözüpek, Ademir Hujdurović +1
We consider a relaxation of the concept of well-covered graphs, which are graphs with all maximal independent sets of the same size. The extent to which a graph fails to be well-co…
On a Class of Graphs with Large Total Domination Number
Selim Bahadır, Didem Gözüpek
Let and denote the domination number and the total domination number, respectively, of a graph with no isolated vertices. It is well-known that $γ_t(G) \leq 2γ(…
Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs
Didem Gözüpek, Ademir Hujdurović, Martin Milanič
A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-…
Equimatchable Claw-Free Graphs
Saieed Akbari, Hadi Alizadeh, Tınaz Ekim +2
A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide, to t…