Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Keaitsuda Maneeruk Nakprasit is active.

Publication


Featured researches published by Keaitsuda Maneeruk Nakprasit.


International Journal of Mathematics and Mathematical Sciences | 2018

Some Bounds for the Polar Derivative of a Polynomial

Jiraphorn Somsuwan; Keaitsuda Maneeruk Nakprasit

The polar derivative of a polynomial of degree with respect to a complex number is a polynomial , denoted by . Let . For a polynomial of degree having all its zeros in , we investigate a lower bound of modulus of on . Furthermore, we present an upper bound of modulus of on for a polynomial of degree having no zero in . In particular, our results in case generalize some well-known inequalities.


Graphs and Combinatorics | 2018

The Game Coloring Number of Planar Graphs with a Specific Girth

Keaitsuda Maneeruk Nakprasit; Kittikorn Nakprasit

Let


Information Processing Letters | 2017

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

Keaitsuda Maneeruk Nakprasit; Kittikorn Nakprasit


International Journal of Mathematics and Mathematical Sciences | 2015

Analytic Solutions of a Second-Order Functional Differential Equation with a State Derivative Dependent Delay

Jiraphorn Somsuwan; Keaitsuda Maneeruk Nakprasit

\mathrm{col_g}(G)


Theoretical Computer Science | 2012

Equitable colorings of planar graphs without short cycles

Keaitsuda Maneeruk Nakprasit; Kittikorn Nakprasit


Discrete Mathematics | 2014

The strong chromatic index of graphs and subdivisions

Keaitsuda Maneeruk Nakprasit; Kittikorn Nakprasit

colg(G) be the game coloring number of a given graph G. Define the game coloring number of a family of graphs


arXiv: Complex Variables | 2018

Some Inequalities for the Polar Derivative of Some Classes of Polynomials

Nuttapong Arunrat; Keaitsuda Maneeruk Nakprasit


Journal of Mathematical Inequalities | 2017

An Upper bound of a derivative for some class of polynomials

Keaitsuda Maneeruk Nakprasit; Jiraphorn Somsuwan

\mathcal {H}


arXiv: Combinatorics | 2016

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

Keaitsuda Maneeruk Nakprasit; Kittikorn Nakprasit


arXiv: Combinatorics | 2016

Complexity of equitable tree-coloring problems

Keaitsuda Maneeruk Nakprasit; Kittikorn Nakprasit

H as

Collaboration


Dive into the Keaitsuda Maneeruk Nakprasit's collaboration.

Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge