Fault-Tolerant Partition Resolvability of Cyclic Networks

Kamran Azhar, Sohail Zafar, Agha Kashif, Michael Onyango Ojiema and Gohar Ali

Journal of Mathematics, 2021, vol. 2021, 1-8

Abstract: Graph invariants provide an amazing tool to analyze the abstract structures of networks. The interaction and interconnection between devices, sensors, and service providers have opened the door for an eruption of mobile over the web applications. Structure of web sites containing number of pages can be represented using graph, where web pages are considered to be the vertices, and an edge is a link between two pages. Figuring resolving partition of the graph is an intriguing inquest in graph theory as it has many applications such as sensor design, compound classification in chemistry, robotic navigation, and Internet network. The partition dimension is a graph parameter akin to the concept of metric dimension, and fault-tolerant partition dimension is an advancement in the line of research of partition dimension of the graph. In this paper, we compute fault-tolerant partition dimension of alternate triangular cycle, mirror graph, and tortoise graphs.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/7237168.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/7237168.xml (application/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:jjmath:7237168

DOI: 10.1155/2021/7237168

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().