P. Kaemawichanurat

activity

20182024

most citedExtensions of the Art Gallery Theorem

1 citations · 2 across the 18 of their papers we have counts for

collaborators

Showing 2019Show all

8 papers · 1 filter

math.CO2019

Independence and Connectivity of Connected Domination Critical Graphs

Pawaton Kaemawichanurat, Louis Caccetta

A graph $G$ is said to be $k$ - $γ_{c}$ -critical if the connected domination number $γ_{c} (G) = k$ and $γ_{c} (G + uv) < k$ for every $uv \in E (G)$ . Let $δ, κ$ and $α$ be r…

math.CO2019

Niche Number of Linear Hypertrees

Thummarat Paklao, Nattakan Yahatta, Chutima Chaichana +2

For a digraph $D$ , the niche hypergraph $N H (D)$ of $D$ is the hypergraph having the same set of vertices as $D$ and the set of hyperedges is \begin{align} E(NH(D)) &= \{e \subseteq…

math.CO2019

Hamiltonicity of Domination Vertex-Critical Claw-Free Graphs

Pawaton Kaemawichanurat

A graph $G$ is said to be $k$ - $γ$ -vertex critical if the domination numbers $γ (G)$ of $G$ is $k$ and $γ (G - v) < k$ for any vertex $v$ of $G$ . Similarly, A graph $G$ is said to be…

math.CO2019

Disjoint Cross Intersecting Families

Nuttanon Songsuwan, Supida Sengsamak, Nutchapol Jeerawattana +2

For positive integers $n$ and $r$ such that $r \leq ⌊ n /2 ⌋$ , let $X$ be a set of $n$ elements and let $(r X)$ be the family of all $r$ -subsets of $X$ . Two sub-fa…

math.CO2019

Structural Properties of Connected Domination Critical Graphs

Pawaton Kaemawichanurat

A graph $G$ is said to be $k$ - $γ_{c}$ -critical if the connected domination number $γ_{c} (G)$ is equal to $k$ and $γ_{c} (G + uv) < k$ for any pair of non-adjacent vertices $u$ and $…

math.CO2019

Traceability of Connected Domination Critical Graphs

Michael A. Henning, Nawarat Ananchuen, Pawaton Kaemawichanurat

A dominating set in a graph $G$ is a set $S$ of vertices of $G$ such that every vertex outside $S$ is adjacent to a vertex in $S$ . A connected dominating set in $G$ is a dominating…

math.CO2019

Inequalities of Independence Number, Clique Number and Connectivity of Maximal Connected Domination Critical Graphs

Norah Almalki, Pawaton Kaemawichanurat

A $k$ - $γ_{c}$ -edge critical graph is a graph $G$ with the connected domination number $γ_{c} (G) = k$ and $γ_{c} (G + uv) < k$ for every $uv \in E (G)$ . Further, a $2$ -conn…

math.CO2019

Partial domination of maximal outerplanar graphs

Peter Borg, Pawaton Kaemawichanurat

Several domination results have been obtained for maximal outerplanar graphs (mops). The classical domination problem is to minimize the size of a set $S$ of vertices of an $n$ -ver…