Computation of Maximal Connectivity for Fault Tolerance: Graph Theoretical Model and Algorithm

Abstract

With the exponential growth in development of network communication technology has lead to build
complex networks structures to handle real time distributed communication applications, which in turn
demands guaranteed end-to-end quality of service (QoS) . Fault tolerance is a key issue in the design of
such computer communication network structures. Researchers and designers have majorly considered
deterministic graph-theoretic concepts of measure for fault tolerance. The concept of connectivity ĸ of
the network graph N is the key graph-theoretic deterministic measure for fault tolerance. This research
article presents a mathematical model with a proof and an algorithm to measure the maximum
connectivity range in a given network by knowing the quantity of connected nodes along with the active
links present in a network structure.