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.
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.
Primary Language | English |
---|---|
Subjects | Information Systems (Other) |
Journal Section | Articles |
Authors | |
Publication Date | June 27, 2025 |
Submission Date | December 23, 2024 |
Acceptance Date | April 29, 2025 |
Published in Issue | Year 2025 Volume: 14 Issue: 2 |
This work is licensed under the Creative Commons Attribution-Non-Commercial-Non-Derivable 4.0 International License.