Loading
 Nopparat Pleanmani

Nopparat Pleanmani

คณะวิทยาศาสตร์,
มหาวิทยาลัยขอนแก่น
57199506602: H-INDEX 2

บทความ

TCI อ้างอิงจาก http://www.tci-thaijo.org/

0

SCOPUS

0

PUBMED

0

ISI

0

TCI

Title Author Year SCOPUS PUBMED ISI TCI
1. Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph Nopparat Pleanmani 2019
2. Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete graph Pleanmani, N. 2020
3. A note on pebbling bound for a product of Class 0 graphs Worawiset, S. 2022
4. BOUNDS FOR THE PEBBLING NUMBER OF PRODUCT GRAPHS Pleanmani, N.
Nupo, N.
Worawiset, S.
2022
Count 4 0 1 0

Title Authors Year Publication name Cited count
< 2020 2021 2022 2023 2024 2025 รวม
1. Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph Pleanmani, N. 2019 Discrete Mathematics, Algorithms and Applications
6 (11), pp.
2. Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete graph Pleanmani, N. 2020 Theory and Applications of Graphs
1 (7), pp.
3. A note on pebbling bound for a product of Class 0 graphs Worawiset, S. 2022 Asian-European Journal of Mathematics
2 (15), pp.
4. BOUNDS FOR THE PEBBLING NUMBER OF PRODUCT GRAPHS Pleanmani, N.
Nupo, N.
Worawiset, S.
2022 Transactions on Combinatorics
4 (11), pp. 317-326

Title Authors Year Journal title

Title Authors Year Journal title Cited count
< 2020 2021 2022 2023 2024 2025 รวม
1. Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph Nopparat Pleanmani 2019 DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS
6.0 (11.0), pp.
0 0 0 0 0 0 0

Title Authors Year Journal title

ชื่อโครงการ Authors ประเภทโครงการ ปีงบประมาณ ทุนวิจับ

0.012170553207397461