Year: 2021
Type: article
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.
Institution: Hasanuddin University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W3162666349
