Pakanun Dokyeesun

activity

20232025

collaborators

Showing math.COShow all

7 papers · 1 filter

math.CO2025

On the variety of general position problems under vertex and edge removal

Jing Tian, Pakanun Dokyeesun, Sandi Klavžar

Let $gp_{t} (G)$ , $gp_{o} (G)$ , and $gp_{d} (G)$ be the total, the outer, and the dual general position number of a graph $G$ , respectively. This paper i…

math.CO2025

Visibility in graphs under edge and vertex removal

Pakanun Dokyeesun, Csilla Bujtás

For a connected graph $G$ and $X \subseteq V (G)$ , we say that two vertices $u$ , $v$ are $X$ -visible if there is a shortest $u, v$ -path $P$ with $V (P) \cap X \subseteq {u, v}$ . If eve…

math.CO2025

Criticality for Maker-Breaker domination games with predomination

Csilla Bujtás, Pakanun Dokyeesun, Sandi Klavžar +1

A predominated graph is a pair $(G, D)$ , where $G$ is a graph and the vertices in $D \subseteq V (G)$ are considered already dominated. Maker-Breaker domination game critical (MBD cri…

math.CO2025

Thresholds for the biased Maker-Breaker domination games

Boštjan Brešar, Csilla Bujtás, Pakanun Dokyeesun +1

In the $(a, b)$ -biased Maker-Breaker domination game, two players alternately select unplayed vertices in a graph $G$ such that Dominator selects $a$ and Staller selects $b$ vertice…

math.CO2024

General position problems in strong and lexicographic products of graphs

Pakanun Dokyeesun, Sandi Klavžar, Dorota Kuziak +1

Outer, dual, and total general position sets are studied on strong and lexicographic products of graphs. Sharp lower and upper bounds are proved for the outer and the dual general…

math.CO2024

The general position number under vertex and edge removal

Pakanun Dokyeesun, Sandi Klavžar, Jing Tian

Let $gp (G)$ be the general position number of a graph $G$ . It is proved that $gp (G - x) \leq 2 gp (G)$ holds for any vertex $x$ of a connected graph $G$ and that if $x…