TY - JOUR
AU - Safriadi, Safriadi
AU - Hasmawati, Hasmawati
AU - Haryanto, Loeky
PY - 2020/04/28
Y2 - 2024/06/22
TI - Partition Dimension of Complete Multipartite Graph
JF - Jurnal Matematika, Statistika dan Komputasi
JA - J
VL - 16
IS - 3
SE -
DO - 10.20956/jmsk.v16i3.7278
UR - https://journal.unhas.ac.id/index.php/jmsk/article/view/7278
SP - 365-374
AB - <p>Determining a resolving partition of a graph is an interesting study in graph theory due to many applications like censor design, compound classification in chemistry, robotic navigation and internet network. Let and , the distance between an is . For an ordered partition of , the representation of with respect to is . The partition is called a <em>resolving partition</em> of if all representation of vertices are distinct. The partition dimension of graph is the smallest integer such that has a resolving partition with element.</p><p>In this thesis, we determine the partition dimension of complete multipartite graph , which is limited by , with and . We found that , , and , .</p>
ER -