Fault-Tolerant Partition Resolvability of Cyclic Networks. (16th December 2021)

• Record Type: Journal Article
• Authors: Azhar, Kamran; Zafar, Sohail; Kashif, Agha; Ojiema, Michael Onyango
• Other Names: Ali Gohar Academic Editor.
• Is Part Of: Journal of mathematics. Volume 2021(2021)
• Publication Date: 2021-12-16
• Subjects: Mathematics -- Periodicals; Mathematics; Periodicals; 510
• DOI: 10.1155/2021/7237168
• Languages: English
• ISSNs: 2314-4629

Abstract

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.