arXiv subjects

Keaitsuda Maneeruk Nakprasit

Publications and source records attributed to Keaitsuda Maneeruk Nakprasit.

8 recordsLinked to original sources

arXiv2020

Bounds of the Derivative of Some Classes of Rational Functions

Let $r(z)$ be a rational function with at most $n$ poles, $a_1, a_2, \ldots, a_n,$ where $|a_j| > 1,$ $1\leq j\leq n.$ This paper investigates the estimate of the modulus of the derivative of a rational function $r(z)$ on the unit circle. We establish an upper bound when all zeros of $r(z)$ lie in $|z|\geq k\geq 1$ and a lower bound when all zeros of $r(z)$ lie in $|z|\leq k \leq 1.$ In particular, when $k=1$ and $r(z)$ has exactly $n$ zeros, we obtain a generalization of results by A. Aziz and W. M. Shah [Some refinements of Bernstein-type inequalities for rational functions, Glas. Mat., {\bf 32}(52) (1997), 29--37.].

math.CV↗

arXiv2019

Generalization of some results on list coloring and DP-coloring

In this work, we introduce DPG-coloring using the concepts of DP-coloring and variable degeneracy to modify the proofs on the following papers: (i) DP-3-coloring of planar graphs without $4$, $9$-cycles and cycles of two lengths from $\{6, 7, 8\}$ (R. Liu, S. Loeb, M. Rolek, Y. Yin, G. Yu, Graphs and Combinatorics 35(3) (2019) 695-705), (ii) Every planar graph without $i$-cycles adjacent simultaneously to $j$-cycles and $k$-cycles is DP-$4$-colorable when $\{i, j, k\}=\{3, 4, 5\}$ (P. Sittitrai, K. Nakprasit, arXiv:1801.06760(2019) preprint), (iii) Every planar graph is $5$-choosable (C. Thomassen, J. Combin. Theory Ser. B 62 (1994) 180-181). Using this modification, we obtain more results on list coloring, DP-coloring, list-forested coloring, and variable degeneracy.

math.CO↗

arXiv2018

Some Inequalities for the Polar Derivative of Some Classes of Polynomials

In this paper, we investigate an upper bound of the polar derivative of a polynomial of degree $n$ $$p(z)=(z-z_m)^{t_m} (z-z_{m-1})^{t_{m-1}}\cdots (z-z_0)^{t_0}(a_0+\sum\limits_{ν=μ} ^{n-(t_m+\cdots+t_0)} a_νz^ν)$$ where zeros $z_0,\ldots,z_m$ are in $\{z:|z|<1\}$ and the remaining $n-(t_m+\cdots+t_0 )$ zeros are outside $\{z:|z|<k\}$ where $k \geq 1.$ Furthermore, we give a lower bound of this polynomial where zeros $z_0,\ldots,z_m$ are outside $\{z:|z|\leq k\}$ and the remaining $n-(t_m+\cdots+t_0 )$ zeros are in $\{z:|z|<k\}$ where $k\leq 1.$

math.CV↗

arXiv2016

Bounds for the game coloring number of planar graphs with a specific girth

Let ${\rm col_g}(G)$ be the game coloring number of a given graph $G.$ Define the game coloring number of a family of graphs $\mathcal{H}$ as ${\rm col_g}(\mathcal{H}) := \max\{{\rm col_g}(G):G \in \mathcal{H}\}.$ Let $\mathcal{P}_k$ be the family of planar graphs of girth at least $k.$ We show that ${\rm col_g}(\mathcal{P}_7) \leq 5.$ This result extends a result about the coloring number by Wang and Zhang {WZ11} (${\rm col_g}(\mathcal{P}_8) \leq 5).$ We also show that these bounds are sharp by constructing a graph $G$ where $G \in {\rm col_g}(\mathcal{P}_k) \geq 5$ for each $k \leq 8$ such that ${\rm col_g}(G)=5.$ As a consequence, ${\rm col_g}(\mathcal{P}_k) = 5$ for $k =7,8.$

math.CO↗

arXiv2016

Complexity of equitable tree-coloring problems

A $(q,t)$\emph{-tree-coloring} of a graph $G$ is a $q$-coloring of vertices of $G$ such that the subgraph induced by each color class is a forest of maximum degree at most $t.$ A $(q,\infty)$\emph{-tree-coloring} of a graph $G$ is a $q$-coloring of vertices of $G$ such that the subgraph induced by each color class is a forest. Wu, Zhang, and Li introduced the concept of \emph{equitable $(q, t)$-tree-coloring} (respectively, \emph{equitable $(q, \infty)$-tree-coloring}) which is a $(q,t)$-tree-coloring (respectively, $(q, \infty)$-tree-coloring) such that the sizes of any two color classes differ by at most one. Among other results, they obtained a sharp upper bound on the minimum $p$ such that $K_{n,n}$ has an equitable $(q, 1)$-tree-coloring for every $q\geq p.$ In this paper, we obtain a polynomial time criterion to decide if a complete bipartite graph has an equitable $(q,t)$-tree-coloring or an equitable $(q,\infty)$-tree-coloring. Nevertheless, deciding if a graph $G$ in general has an equitable $(q,t)$-tree-coloring or an equitable $(q,\infty)$-tree-coloring is NP-complete.

math.CO↗

arXiv2015

On the solution of a second order functional differential equation with a state derivative dependent delay

In this paper, the second order differential equation with a state derivative dependent delay of the form $a_2x"(z) + a_1x'(z) + a_0x(z) = x(p(z) + bx'(z)) + h(z)$ has been studied. Considering a convergent power series $g(z)$ of an auxiliary equation $a_2 γ^{2} g"(γz) g'(z) = [g (γ^2 z) - p(g(γz))] γg'(γz)(g' (z))^{2} + bh'(g(z))(g' (z))^{3} + \Big( a_2p"(g(z))+ a_1p'(g(z)) +a_0p(g(z))\Big) (g'(z))^{3} - a_1γg'(γz) (g' (z))^{2} - a_0g(γz)(g'(z))^{3} + a_2γg'(γz)g"( z)$ with the relation $p(z) + bx'(z) = g(γg^{-1}(z)),$ we obtain an analytic solution $x(z).$ Moreover, an analytic solution depends on a parameter $γ$ which satisfies one of the following conditions: $(H1) \ 0<|γ|<1,$ $(H2) \ γ= e^{2πi θ}$ where $θ$ is a Brjuno number or $(H3) \ γ= e^{2πi θ}$ where $θ$ is a rational number.

math.CV↗

arXiv2015

Equitable colorings of complete multipartite graphs

A $q$-\emph{equitable coloring} of a graph $G$ is a proper $q$-coloring such that the sizes of any two color classes differ by at most one. In contrast with ordinary coloring, a graph may have an equitable $q$-coloring but has no equitable $(q+1)$-coloring. The \emph{equitable chromatic threshold} is the minimum $p$ such that $G$ has an equitable $q$-coloring for every $q\geq p.$ In this paper, we establish the notion of $p(q: n_1,\ldots, n_k)$ which can be computed in linear-time and prove the following. Assume that $K_{n_1,\ldots,n_k}$ has an equitable $q$-coloring. Then $p(q: n_1,\ldots, n_k)$ is the minimum $p$ such that $K_{n_1,\ldots,n_k}$ has an equitable $r$-coloring for each $r$ satisfying $p \leq r \leq q.$ Since $K_{n_1,\ldots,n_k}$ has an equitable $(n_1+\cdots+n_k)$-coloring, the equitable chromatic threshold of $K_{n_1,\ldots,n_k}$ is $p(n_1+\cdots+n_k: n_1,\ldots, n_k).$ We find out later that the aforementioned immediate consequence is exactly the same as the formula of Yan and Wang \cite{YW12}. Nonetheless, the notion of $p(q: n_1,\ldots, n_k)$ can be used for each $q$ in which $K_{n_1,\ldots,n_k}$ has an equitable $q$-coloring and the proof presented here is much shorter.

math.CO↗

arXiv2015

The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs

A $(q,r)$\emph{-tree-coloring} of a graph $G$ is a $q$-coloring of vertices of $G$ such that the subgraph induced by each color class is a forest of maximum degree at most $r.$ An \emph{equitable $(q, r)$-tree-coloring} of a graph $G$ is a $(q,r)$-tree-coloring such that the sizes of any two color classes differ by at most one. Let the \emph{strong equitable vertex $r$-arboricity} be the minimum $p$ such that $G$ has an equitable $(q, r)$-tree-coloring for every $q\geq p.$ In this paper, we find the exact value for each $va^\equiv_2(K_{m,n})$ and $va^\equiv_2(K_{l,m,n}).$

math.CO↗