Neighbor Rupture Degree of Harary Graphs
| dc.contributor.author | Altundag, FN | |
| dc.contributor.author | Bacak-Turan, G | |
| dc.date.accessioned | 2024-07-18T11:40:03Z | |
| dc.date.available | 2024-07-18T11:40:03Z | |
| dc.description.abstract | The vulnerability shows the endurance of the network until the communication collapse after the breakdown of certain stations or communication links. If a spy or a station is invaded in a spy network, then the adjacent stations are treacherous. A vulnerability parameter the neighbor rupture degree can be used to obtain the vulnerability of a spy network. The neighbor rupture degree of a noncomplete connected graph G is defined to be Nr(G) = max{w(G/S) - |S| - c(G/S) : S subset of V(G), w(G/S) >= 1} where S is any vertex subversion strategy of G, w(G/S) is the number of connected components in G/S, and c(G/S) is the maximum order of the components of G/S. In this paper, the neighbor rupture degree of Harary graphs are obtained. | |
| dc.identifier.issn | 0129-0541 | |
| dc.identifier.other | 1793-6373 | |
| dc.identifier.uri | http://akademikarsiv.cbu.edu.tr:4000/handle/123456789/2113 | |
| dc.language.iso | English | |
| dc.publisher | WORLD SCIENTIFIC PUBL CO PTE LTD | |
| dc.subject | CONNECTIVITY | |
| dc.title | Neighbor Rupture Degree of Harary Graphs | |
| dc.type | Article |