Fault-Tolerant Partition Resolvability of Cyclic Networks

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!

Similar Items

Similar Items