| Autor: |
Amrullah, Arjudin, Hayati, Laila, Soeprianto, Harry |
| Předmět: |
|
| Zdroj: |
AIP Conference Proceedings; 2023, Vol. 2619 Issue 1, p1-7, 7p |
| Abstrakt: |
To find the partition dimension, several researchers investigate the graph in various ways, such as the graph operations or structure of the graph. In this paper, we use the subdivision operation of the graph to determine the partition dimension of the graph. The upper bound of the partition dimension of a complete special graph has been published previously by our group. In this paper show, we give the exact value of the partition dimension of the graph and their subdivisions, S(G), for any connected graph G with order n≤ 5. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
