Zobrazeno 1 - 10
of 102
pro vyhledávání: '"Kaemawichanurat, Pawaton"'
A simple proof on the number of $(3 \times n)$-Latin rectangles based on a set of $\lambda$ elements
Autor:
Thengarnanchai, Pantaree, Kaemawichanurat, Pawaton, Ruksasakchai, Watcharintorn, Klamsakul, Natawat
In 1980, Athreya, Pranesachar and Singhi established the chromatic polynomial of $(3 \times n)$-Latin rectangles whose entries based on a set $\{1, 2, ..., \lambda\}$ in which $\lambda \geq n$. Their proof requires M\"{o}bius inversion formula and la
Externí odkaz:
http://arxiv.org/abs/2407.07378
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 colors required for an irredundance coloring of $G$ is called the irr
Externí odkaz:
http://arxiv.org/abs/2311.06161
Autor:
Oo, Moe Moe, Wiroonsri, Nathakhun, Klamsakul, Natawat, Jiarasuksakun, Thiradet, Kaemawichanurat, Pawaton
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 bezenoid hydrocarbon compounds. In this paper, we establish the generating
Externí odkaz:
http://arxiv.org/abs/2301.09281
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) \setminus D$ is adjacent to a vertex in $D$. The domination number of $G$ is the minimum cardinality of a dominating set of $G$ and is de
Externí odkaz:
http://arxiv.org/abs/2208.07020
A dominating set of a graph $G=(V,E)$ is a vertex set $D$ such that every vertex in $V(G) \setminus D$ is adjacent to a vertex in $D$. The cardinality of a smallest dominating set of $D$ is called the domination number of $G$ and is denoted by $\gamm
Externí odkaz:
http://arxiv.org/abs/2206.07208
Autor:
Klamsakul, Natawat, Thengarnanchai, Pantaree, Suebtangjai, Mattanaporn, Kaewperm, Pailin, Songsuwan, Nuttanon, Kaemawichanurat, Pawaton
Counting the number of maximal independent sets of graphs was started over $50$ years ago by Erd\H{o}s and Mooser. The problem has been continuously studied with a number of variations. Interestingly, when the maximal condition of an independent set
Externí odkaz:
http://arxiv.org/abs/2202.11294
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 \mathbb{N}$ moves from her current point $(x, y)$ to a point $(x', y')$ which $\max\{|x - x'|, |y - y'|\} \leq
Externí odkaz:
http://arxiv.org/abs/2202.08988
Publikováno v:
In Heliyon 15 September 2024 10(17)
Autor:
Tabassum, Hafsah, Bokhary, Syed Ahtsham Ul Haq, Jiarasuksakun, Thiradet, Kaemawichanurat, Pawaton
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$. The dendrimers are higly branched organic macromolecules having repeat
Externí odkaz:
http://arxiv.org/abs/2201.01009