Abstract
Let be a connected graph G and -partition of end . The coordinat to is definition . If every twovertex is distinct applies, then is a called partition of . The minimum k for which k-resolving partition of is the partition dimension and denoted with . In this paper, we investigates the partition dimensionfor a large Dutch windmill graph for and . We show that if for some, forany.
Cite
CITATION STYLE
APA
Hasmawati, H., Nurwahyu, B., Daming, A. S., & Amir, A. K. (2021). Partition Dimension of Dutch Windmill Graph. Jurnal Matematika, Statistika Dan Komputasi, 17(3), 472–483. https://doi.org/10.20956/j.v17i3.13596
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free