Graph Operations and Neighbor Rupture Degree
In a communication network, the vulnerability parameters measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. A vertex subversion strategy of a graph , say , is a set of vertices in whose closed neighborhood is removed from ....
Main Authors: | Saadet Kandİlcİ, Goksen Bacak-Turan, Refet Polat |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2013-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2013/836395 |
Similar Items
-
Neighbor Rupture Degree of Some Middle Graphs
by: Gökşen BACAK-TURAN, et al.
Published: (2018-04-01) -
Edge-Neighbor-Rupture Degree of Graphs
by: Ersin Aslan
Published: (2013-01-01) -
Feasible Sanitary Sewer Network Generation Using Graph Theory
by: Mustafa Erkan Turan, et al.
Published: (2019-01-01) -
Graphs with Bounded Maximum Average Degree and Their Neighbor Sum Distinguishing Total-Choice Numbers
by: Patcharapan Jumnongnit, et al.
Published: (2017-01-01) -
Neighbor Product Distinguishing Total Colorings of Planar Graphs with Maximum Degree at least Ten
by: Dong Aijun, et al.
Published: (2021-11-01)