The Neighbor Toughness of Wheels and Related Networks
| dc.contributor.author | Ersin ASLAN | |
| dc.date.accessioned | 2024-07-24T09:09:11Z | |
| dc.date.available | 2024-07-24T09:09:11Z | |
| dc.date.issued | 2017 | |
| dc.description.abstract | In a network (communication, computer, transportation), the vulnerability parameters measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. The neighbor toughness of a graph G is defined as ( ) ( / ) NT G min : ( / ) G S S G S $ 1 ~ = ( ~ 2, where S is any vertex subversion strategy of G and ω(G/S) is the number of connected components in the graph G/S. In this paper, the relations between neighbor toughness and other parameters are determined. Next, the neighbor toughness of wheels and some related networks namely gear, helm, sunflower and friendshipgraph are calculated. | |
| dc.identifier.DOI-ID | 10.7212/zkufbd.v1i1.561 | |
| dc.identifier.issn | 2146-4987 | |
| dc.identifier.uri | http://akademikarsiv.cbu.edu.tr:4000/handle/123456789/21915 | |
| dc.language.iso | eng | |
| dc.title | The Neighbor Toughness of Wheels and Related Networks | |
| dc.type | Araştırma Makalesi |