Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.10048 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910827508924416 |
|---|---|
| author | Yusuf, Muhammad Ahnaf Hasmawati Hamidi, Muhammad Rozzaq Anwar, Andi Muhammad |
| author_facet | Yusuf, Muhammad Ahnaf Hasmawati Hamidi, Muhammad Rozzaq Anwar, Andi Muhammad |
| contents | The graph G is a pair of sets (V(G), E(G)), where V(G) is a finite set whose elements are called vertices, and E(G) is a set of pairs of members of V(G), which is called the edges. Let G be a simple graph. For an ordered k-partition \{Π\} = \{S_1, S_2, \dots, S_k\} of V(G), the representation of u with respect to \{Π\} is k-ordered pairs, r(u \mid \{Π\}) = (d(u, S_1), d(u, S_2), \dots, d(u, S_k)). The partition \{Π\} is called a resolving partition of G if r(u \mid \{Π\}) \neq r(v \mid \{Π\}) for all distinct u, v \in V(G). The resolving partition \{Π\} with the minimum cardinality is called minimum resolving partition. The partition dimension of G, denoted pd(G), is the cardinality of a minimum resolving partition of G.
In this research, we determine the partition dimension of the corona product of a complete graph using some mathematical statements about resolving partitions, the concept of equivalent vertices, and same-level vertices. Several analysis results for the K_n \circ W_m vertices refer to equivalent vertices and the same-level vertices concept. The results show that for m = n, pd(K_n \circ W_m) = n, for n \geq 3, for m = n + 1, pd(K_n \circ W_m) = 3 for n = 3, and pd(K_n \circ W_m) = n for n \geq 3. For m = n + 2, pd(K_n \circ W_m) = 4 for n = 2, 3, and pd(K_n \circ W_m) = n for n \geq 4. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_10048 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The Partition Dimension of Corona Product of Complete and Wheel Graph Yusuf, Muhammad Ahnaf Hasmawati Hamidi, Muhammad Rozzaq Anwar, Andi Muhammad Combinatorics The graph G is a pair of sets (V(G), E(G)), where V(G) is a finite set whose elements are called vertices, and E(G) is a set of pairs of members of V(G), which is called the edges. Let G be a simple graph. For an ordered k-partition \{Π\} = \{S_1, S_2, \dots, S_k\} of V(G), the representation of u with respect to \{Π\} is k-ordered pairs, r(u \mid \{Π\}) = (d(u, S_1), d(u, S_2), \dots, d(u, S_k)). The partition \{Π\} is called a resolving partition of G if r(u \mid \{Π\}) \neq r(v \mid \{Π\}) for all distinct u, v \in V(G). The resolving partition \{Π\} with the minimum cardinality is called minimum resolving partition. The partition dimension of G, denoted pd(G), is the cardinality of a minimum resolving partition of G. In this research, we determine the partition dimension of the corona product of a complete graph using some mathematical statements about resolving partitions, the concept of equivalent vertices, and same-level vertices. Several analysis results for the K_n \circ W_m vertices refer to equivalent vertices and the same-level vertices concept. The results show that for m = n, pd(K_n \circ W_m) = n, for n \geq 3, for m = n + 1, pd(K_n \circ W_m) = 3 for n = 3, and pd(K_n \circ W_m) = n for n \geq 3. For m = n + 2, pd(K_n \circ W_m) = 4 for n = 2, 3, and pd(K_n \circ W_m) = n for n \geq 4. |
| title | The Partition Dimension of Corona Product of Complete and Wheel Graph |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2502.10048 |