Didem Gözüpek

activity

20132026

most citedA Fair Scheduling Model for Centralized Cognitive Radio Networks

4 citations · 10 across the 7 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

Packing chromatic critical graphs with radius at most 2

Aslıhan Gür, Didem Gözüpek, Hadi Alizadeh

For a graph $G$ with vertex set $V (G)$ and a positive integer $i$ , an $i$ -packing in $G$ is a subset $X$ of $V (G)$ such that the distance between any two distinct vertices of $X$ i…

math.CO2020

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…

math.CO2018

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…