On The Partition Dimension of Disconnected Graphs
For a graph G=(V,E), a partition Ω=\{O_1,O_2,…,O_k \} of the vertex set V is called a resolving partition if every pair of vertices u,v∈V(G) have distinct representations under Ω. The partition dimension of G is the minimum integer k such that G has a resolving k-partition. Many results in determini...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
ITB Journal Publisher
2017-06-01
|
| Series: | Journal of Mathematical and Fundamental Sciences |
| Subjects: | |
| Online Access: | http://journals.itb.ac.id/index.php/jmfs/article/view/2459 |