4 citations · 10 across the 7 of their papers we have counts for
12 papers
A Graph Theoretic Approach to Spatial Modeling of Post Disaster Shelter Camps Using Rainbow and Roman Domination Parameters
Didem Gözüpek, Piotr Lange, Joanna Raczek
Effective spatial organization of post-disaster shelter camps is essential for ensuring access to basic services while making efficient use of limited space and resources. In this…
Packing chromatic critical graphs with radius at most 2
Aslıhan Gür, Didem Gözüpek, Hadi Alizadeh
For a graph with vertex set and a positive integer , an -packing in is a subset of such that the distance between any two distinct vertices of i…
Well-Totally-Dominated Graphs
Selim Bahadır, Tınaz Ekim, Didem Gözüpek
A subset of vertices in a graph is called a total dominating set if every vertex of the graph is adjacent to at least one vertex of this set. A total dominating set is called minim…
Paired Domination versus Domination and Packing Number in Graphs
Magda Dettlaff, Didem Gözüpek, Joanna Raczek
Given a graph , the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph are denoted by , $γ_{\r…
Mind the Independence Gap
Tınaz Ekim, Didem Gözüpek, Ademir Hujdurović +1
The independence gap of a graph was introduced by Ekim et al. (2018) as a measure of how far a graph is from being well-covered. It is defined as the difference between the maximum…
Minimum Reload Cost Graph Factors
Julien Baste, Didem Gözüpek, Mordechai Shalom +1
The concept of Reload cost in a graph refers to the cost that occurs while traversing a vertex via two of its incident edges. This cost is uniquely determined by the colors of the…
Minimum Reload Cost Cycle Cover in Complete Graphs
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan
The reload cost refers to the cost that occurs along a path on an edge-colored graph when it traverses an internal vertex between two edges of different colors. Galbiati et al.[1]…
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
Julien Baste, Didem Gözüpek, Christophe Paul +3
We study the minimum diameter spanning tree problem under the reload cost model (DIAMETER-TREE for short) introduced by Wirth and Steffan (2001). In this problem, given an undirect…
Edge Coloring with Minimum Reload/Changeover Costs
Didem Gözüpek, Mordechai Shalom
In an edge-colored graph, a traversal cost occurs at a vertex along a path when consecutive edges with different colors are traversed. The value of the traversal cost depends only…
A Simple Extension of Dirac's Theorem on Hamiltonicity
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan +1
The classical Dirac theorem asserts that every graph on vertices with minimum degree is Hamiltonian. The lower bound of on…
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability
Didem Gözüpek, Sibel Özkan, Christophe Paul +2
In an edge-colored graph, the cost incurred at a vertex on a path when two incident edges with different colors are traversed is called reload or changeover cost. The "Minimum Chan…
A Fair Scheduling Model for Centralized Cognitive Radio Networks
Didem Gözüpek, Fatih Alagöz
We formulate throughput maximizing, max-min fair, weighted max-min fair, and proportionally fair scheduling problems for cognitive radio networks managed by a centralized cognitive…