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. | A note on pebbling bound for a product of Class 0 graphs | Worawiset, S. | 2022 | ||||
3. | BOUNDS FOR THE PEBBLING NUMBER OF PRODUCT GRAPHS | Pleanmani, N. Nupo, N. Worawiset, S. |
2022 | Count | 2 | 0 | 1 | 0 |
Title | Authors | Year | Publication name | Cited count | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
< 2017 | 2018 | 2019 | 2020 | 2021 | 2022 | Total | ||||||
1. | A note on pebbling bound for a product of Class 0 graphs | Worawiset, S. | 2022 |
Asian-European Journal of Mathematics 2 (15), pp. |
||||||||
2. | 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 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
< 2017 | 2018 | 2019 | 2020 | 2021 | 2022 | Total | ||||||
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 |
---|
Title | Authors | NRIIS type | Year | NRIIS Scholarship |
---|