Fault-Tolerant Partition Resolvability of Cyclic Networks

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Kamran Azhar, Sohail Zafar, Agha Kashif, Michael Onyango Ojiema
Format: Article
Language:English
Published: Wiley 2021-01-01
Series:Journal of Mathematics
Online Access:http://dx.doi.org/10.1155/2021/7237168
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832546015574491136
author Kamran Azhar
Sohail Zafar
Agha Kashif
Michael Onyango Ojiema
author_facet Kamran Azhar
Sohail Zafar
Agha Kashif
Michael Onyango Ojiema
author_sort Kamran Azhar
collection DOAJ
description 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.
format Article
id doaj-art-c511e78f36bb4f2899c68c22a31095c6
institution Kabale University
issn 2314-4785
language English
publishDate 2021-01-01
publisher Wiley
record_format Article
series Journal of Mathematics
spelling doaj-art-c511e78f36bb4f2899c68c22a31095c62025-02-03T07:24:09ZengWileyJournal of Mathematics2314-47852021-01-01202110.1155/2021/7237168Fault-Tolerant Partition Resolvability of Cyclic NetworksKamran Azhar0Sohail Zafar1Agha Kashif2Michael Onyango Ojiema3University of Management and Technology (UMT)University of Management and Technology (UMT)University of Management and Technology (UMT)Masinde Muliro University of Science and TechnologyGraph 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.http://dx.doi.org/10.1155/2021/7237168
spellingShingle Kamran Azhar
Sohail Zafar
Agha Kashif
Michael Onyango Ojiema
Fault-Tolerant Partition Resolvability of Cyclic Networks
Journal of Mathematics
title Fault-Tolerant Partition Resolvability of Cyclic Networks
title_full Fault-Tolerant Partition Resolvability of Cyclic Networks
title_fullStr Fault-Tolerant Partition Resolvability of Cyclic Networks
title_full_unstemmed Fault-Tolerant Partition Resolvability of Cyclic Networks
title_short Fault-Tolerant Partition Resolvability of Cyclic Networks
title_sort fault tolerant partition resolvability of cyclic networks
url http://dx.doi.org/10.1155/2021/7237168
work_keys_str_mv AT kamranazhar faulttolerantpartitionresolvabilityofcyclicnetworks
AT sohailzafar faulttolerantpartitionresolvabilityofcyclicnetworks
AT aghakashif faulttolerantpartitionresolvabilityofcyclicnetworks
AT michaelonyangoojiema faulttolerantpartitionresolvabilityofcyclicnetworks