Gülnaz Boruzanlı Ekinci

activity

20192026

collaborators

7 papers

math.CO2026

S-packing chromatic critical paths and cycles

Gülnaz Boruzanlı Ekinci, Csilla Bujtás, Didem Gözüpek +1

Let $S = (s_{1}, s_{2}, \dots)$ be a non-decreasing sequence of positive integers. For a graph $G$ with vertex set $V (G)$ , a labeling $ϕ : V (G) \to {1, \dots, k}$ is an $S$ -packing $k…

math.CO2025

S-packing chromatic critical graphs

Gülnaz Boruzanlı Ekinci, Csilla Bujtás, Didem Gözüpek +1

For a non-decreasing sequence of positive integers $S = (s_{1}, s_{2}, \dots)$ , the $S$ -packing chromatic number of a graph $G$ is denoted by $χ_{S} (G)$ . In this paper, $χ_{S}$ -critical graph…

math.CO2024

Mutual-visibility problems in Kneser and Johnson graphs

Gülnaz Boruzanli Ekinci, Csilla Bujtás

Let $G$ be a connected graph and $X \subseteq V (G)$ . By definition, two vertices $u$ and $v$ are $X$ -visible in $G$ if there exists a shortest $u, v$ -path with all interna…

math.CO2023

Structure and substructure connectivity of folded divide-and-swap cube

Muhammed Türkmen, Canan Çiftçi, Gülnaz Boruzanlı Ekinci

Let $H$ be a connected subgraph of a graph $G$ . The structure connectivity of $G$ , denoted by $κ (G; H)$ , is the minimum number of a set of connected subgraphs in $G$ , whos…

math.CO2020

Bipartite graphs with close domination and k-domination numbers

Gülnaz Boruzanlı Ekinci, Csilla Bujtás

Let $k$ be a positive integer and let $G$ be a graph with vertex set $V (G)$ . A subset $D \subseteq V (G)$ is a $k$ -dominating set if every vertex outside $D$ is adjacent to at least…

math.CO2019

On the equality of domination number and $2$ -domination number