On Partition Dimension of Some Cycle-Related Graphs

Changcheng Wei, Muhammad Faisal Nadeem, Hafiz Muhammad Afzal Siddiqui, Muhammad Azeem, Jia-Bao Liu and Adnan Khalil

Mathematical Problems in Engineering, 2021, vol. 2021, 1-8

Abstract:

Let be a simple connected graph. Suppose an - partition of . A partition representation of a vertex is the vector , denoted by . Any partition is referred as resolving partition if such that . The smallest integer is referred as the partition dimension of if the - partition is a resolving partition. In this article, we discuss the partition dimension of kayak paddle graph, cycle graph with chord, and a graph generated by chain of cycles. It has been shown that the partition dimension of the said families of graphs is constant.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2021/4046909.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2021/4046909.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:4046909

DOI: 10.1155/2021/4046909

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().