Work

Fault-Tolerant Partition Resolvability of Cyclic Networks

Year: 2021

Type: article

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.

Source: Journal of Mathematics

DOI: 10.1155/2021/7237168

Authors: Kamran Azhar, Sohail Zafar, Agha Kashif, Michael Onyango Ojiema

Institutions: University of Management and Technology, Masinde Muliro University of Science and Technology

Language: English

Topic: Graph Labeling and Dimension Problems

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $2,160

OpenAlex ID: W4200445672