Graph Operations and Neighbor Rupture Degree | Zendy

Saadet Kandİlcİ | Zendy; Gökşen Bacak-Turan | Zendy; Refet Polat | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Graph Operations and Neighbor Rupture Degree

Author(s) -

Saadet Kandİlcİ,

Gökşen Bacak-Turan,

Refet Polat

Publication year - 2013

Publication title -

journal of applied mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.307

H-Index - 43

eISSN - 1687-0042

pISSN - 1110-757X

DOI - 10.1155/2013/836395

Subject(s) - vertex (graph theory) , combinatorics , degree (music) , subversion , graph , mathematics , discrete mathematics , computer science , physics , politics , political science , acoustics , law

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 . The survival subgraph is denoted by . The neighbor rupture degree of , , is defined to be , where is any vertex subversion strategy of , is the number of connected components in and is the maximum order of the components of (G. Bacak Turan, 2010). In this paper we give some results for the neighbor rupture degree of the graphs obtained by some graph operations

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research