Computation of Double Domination Integrity of Some Special Graphs

Abstract

In a communication network, the idea of vulnerability is important when there is a network disruption. There are numerous graph parameters available to measure a communication network's susceptibility. One of the vulnerability metrics used to assess a communication network's performance is double domination integrity. This article presents the double domination integrity of some special graphs and also suggests an application of double domination integrity in the real world.