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

20 papers

math.CO2024

A simple proof on the number of $(3 \times n)$ -Latin rectangles based on a set of $λ$ elements

Pantaree Thengarnanchai, Pawaton Kaemawichanurat, Watcharintorn Ruksasakchai +1

In 1980, Athreya, Pranesachar and Singhi established the chromatic polynomial of $(3 \times n)$ -Latin rectangles whose entries based on a set ${1, 2, ..., λ}$ in which $λ \geq n$ .…

math.CO2023

On irredundance coloring and irredundance compelling coloring of graphs

David Ashok Kalarkop, Pawaton Kaemawichanurat

Irredundance coloring of $G$ is a proper coloring in which there exists a maximal irredundant set $R$ such that all the vertices of $R$ have different colors. The minimum number of…

math.CO2023★ 1 cited

The Expected Values of Hosoya Index and Merrifield-Simmons Index of Random Hexagonal Cacti

Moe Moe Oo, Nathakhun Wiroonsri, Natawat Klamsakul +2

Hosoya index and Merrifield-Simmons index are two well-known topological descriptors that reflex some physical properties, boiling point or heat of formation for instance, of bezen…

math.CO2022

On graphs whose domination number is equal to chromatic and dominator chromatic numbers

David A. Kalarkop, Pawaton Kaemawichanurat, Raghavachar Rangarajan

For a graph $G = (V (G), E (G))$ , a dominating set $D$ is a vertex subset of $V (G)$ in which every vertex of $V (G) ∖ D$ is adjacent to a vertex in $D$ . The domination number…

math.CO2022

Partial Domination and Irredundance Numbers in Graphs

Pawaton Kaemawichanurat, Odile Favaron

A dominating set of a graph $G = (V, E)$ is a vertex set $D$ such that every vertex in $V (G) ∖ D$ is adjacent to a vertex in $D$ . The cardinality of a smallest dominating set…

math.CO2022

Maximal Independent Sets in Polygonal Cacti

Natawat Klamsakul, Pantaree Thengarnanchai, Mattanaporn Suebtangjai +3

Counting the number of maximal independent sets of graphs was started over $50$ years ago by Erdős and Mooser. The problem has been continuously studied with a number of variations…

math.CO2022

Drunk Angel and Hiding Devil

Nuttanon Songsuwan, Anuwat Tangthanawatsakul, Pawaton Kaemawichanurat

The angel game is played on $2$ -dimensional infinite grid by $2$ players, the angel and the devil. In each turn, the angel of power $c \in N$ moves from her current point…

math.CO2022

Counting the numbers of paths of all lengths in dendrimers and its applications

Hafsah Tabassum, Syed Ahtsham Ul Haq Bokhary, Thiradet Jiarasuksakun +1

For positive integers $n$ and $k$ , the dendrimer $T_{n, k}$ is defined as the rooted tree of radius $n$ whose all vertices at distance less than $n$ from the root have degree $k$ .…

math.CO2021

Quasi-strongly regular graphs of grade three with diameter two

Songpon Sriwongsa, Pawaton Kaemawichanurat

A quasi-strongly regular graph of grade $p$ with parameters $(n, k, a; c_{1}, \dots, c_{p})$ is a $k$ -regular graph of order $n$ such that any two adjacent vertices share $a$ common n…

math.CO2020★ 1 cited

Extensions of the Art Gallery Theorem

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…

math.CO2020

Inequalities between Partial Domination and Independent Partial Domination in Graphs

Odile Favaron, Pawaton Kaemawichanurat

For a graph $G$ , a vertex subset $S \subseteq V (G)$ is said to be $K_{k}$ -isolating if $G - N_{G} [S]$ does not contain $K_{k}$ as a subgraph. The $K_{k}$ -isolation number of $G$ , d…

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…

math.CO2018

Isolation of $k$ -cliques

Peter Borg, Kurt Fenech, Pawaton Kaemawichanurat

For any positive integer $k$ and any $n$ -vertex graph $G$ , let $ι (G, k)$ denote the size of a smallest set $D$ of vertices of $G$ such that the graph obtained from $G$ by deleting t…

A simple proof on the number of (3×n)-Latin rectangles based on a set of λ elements

On irredundance coloring and irredundance compelling coloring of graphs

The Expected Values of Hosoya Index and Merrifield-Simmons Index of Random Hexagonal Cacti

On graphs whose domination number is equal to chromatic and dominator chromatic numbers

Partial Domination and Irredundance Numbers in Graphs

Maximal Independent Sets in Polygonal Cacti

Drunk Angel and Hiding Devil

Counting the numbers of paths of all lengths in dendrimers and its applications

Quasi-strongly regular graphs of grade three with diameter two

Extensions of the Art Gallery Theorem

Inequalities between Partial Domination and Independent Partial Domination in Graphs

Independence and Connectivity of Connected Domination Critical Graphs

Niche Number of Linear Hypertrees

Hamiltonicity of Domination Vertex-Critical Claw-Free Graphs

Disjoint Cross Intersecting Families

Structural Properties of Connected Domination Critical Graphs

Traceability of Connected Domination Critical Graphs

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

Partial domination of maximal outerplanar graphs

Isolation of k-cliques

A simple proof on the number of $(3 \times n)$ -Latin rectangles based on a set of $λ$ elements

Isolation of $k$ -cliques