Graph operations and neighbor rupture degree
Abstract
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 G, say S, is a set of vertices
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84883195122&doi=10.1155%2f2013%2f836395&partnerID=40&md5=b88e52fb8440c69d5a3bbca251a85030https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10485
Collections
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..