Rupture Degree of Some Wheel Related Graphs

It is desirable that computer or communication networks continue to operate without interruption in the case of an attack or partial disruption. If a network modeled by a graph, then there are various graph theoretical parameters used to express the stability and vulnerability of communication networks. One of them is the concept of rupture degree. In this paper, we determine exact values for the rupture degree of wheel related graphs.