The Partition Dimension of Daisy Graphs and Its Barbell
The partition dimension of a graph is determined by minimum number of vertex partitions such that every vertex has different distances to the ordered partitions. A complete graph is very easy to determine its partition dimension because each vertex has the same distance to other vertices. However, what are the partition dimension if a complete graph is modified so that it becomes a daisy graph. In this paper, we discuss the partition dimension of daisy graphs. Next, we will also provide barbell graph operations on daisy graphs.
Authors
- Dina Eka Nurvazly
- Asmiati Asmiati (ORCID: https://orcid.org/0000-0002-6716-0346)
- Nur Zatul Akmar Hamzah (ORCID: https://orcid.org/0000-0001-5160-5534)
- Aulia Ajie Rachmawati
Institutions
- Lampung University (ID)
Publication Details
- Journal
- Science & Technology Indonesia
- Published
- 2025-03-31
- DOI
- https://doi.org/10.26554/sti.2025.10.2.313-319
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- article
- Field-Weighted Citation Impact
- 0.00