z-logo
open-access-imgOpen Access
On the Fault Tolerant Partition Resolvability of Toeplitz Networks
Author(s) -
Asım Nadeem,
Agha Kashif,
Amer Aljaedi,
Sohail Zafar
Publication year - 2022
Publication title -
mathematical problems in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.262
H-Index - 62
eISSN - 1026-7077
pISSN - 1024-123X
DOI - 10.1155/2022/3429091
Subject(s) - partition (number theory) , bounded function , dimension (graph theory) , mathematics , discrete mathematics , combinatorics , mathematical analysis
In any interconnection network, fault tolerance is the most desirable property to achieve reliability. Toeplitz networks are used as interconnection networks due their smaller diameter, symmetry, simpler routing, high connectivity, and reliability. The partition dimension of a network is presented as an extension of metric dimension of networks. Its applications can be seen in several areas including robot navigation, network designing, image processing, and chemistry. In this article, the fault tolerant partition dimension, pd 2 T n 1 , t , of Toeplitz networks, is shown to be bounded below by 4 for t ≥ 2 , n ≥ 4 , whereas it is bounded above by 5 for t = 3 , n ≥ 14 . Further, it is shown that the exact value of pd 2 T n 1 , t equals 4 for t = 2 , n ≥ 4 ; t = 3 , n ∈ 5,6 , … , 13 ; and t ≥ 4 , n ∈ t + 2 , t + 3 , t + 4 .

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom