1 citations · 1 across the 14 of their papers we have counts for
20 papers
A simple proof on the number of -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 -Latin rectangles whose entries based on a set in which .…
On irredundance coloring and irredundance compelling coloring of graphs
David Ashok Kalarkop, Pawaton Kaemawichanurat
Irredundance coloring of is a proper coloring in which there exists a maximal irredundant set such that all the vertices of have different colors. The minimum number of…
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…
On graphs whose domination number is equal to chromatic and dominator chromatic numbers
David A. Kalarkop, Pawaton Kaemawichanurat, Raghavachar Rangarajan
For a graph , a dominating set is a vertex subset of in which every vertex of is adjacent to a vertex in . The domination number…
Partial Domination and Irredundance Numbers in Graphs
Pawaton Kaemawichanurat, Odile Favaron
A dominating set of a graph is a vertex set such that every vertex in is adjacent to a vertex in . The cardinality of a smallest dominating set…
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 years ago by Erdős and Mooser. The problem has been continuously studied with a number of variations…