Open Access
Translator Disclaimer
2013 Graph Operations and Neighbor Rupture Degree
Saadet Kandİlcİ, Goksen Bacak-Turan, Refet Polat
J. Appl. Math. 2013: 1-7 (2013). DOI: 10.1155/2013/836395

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 in G whose closed neighborhood is removed from G. The survival subgraph is denoted by G/S. The neighbor rupture degree of G, Nr(G), is defined to be Nr (G) =max{w(G/S) -|S| - c(G/S): S  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 (G. Bacak Turan, 2010). In this paper we give some results for the neighbor rupture degree of the graphs obtained by some graph operations.

Citation

Download Citation

Saadet Kandİlcİ. Goksen Bacak-Turan. Refet Polat. "Graph Operations and Neighbor Rupture Degree." J. Appl. Math. 2013 1 - 7, 2013. https://doi.org/10.1155/2013/836395

Information

Published: 2013
First available in Project Euclid: 14 March 2014

zbMATH: 1271.90016
MathSciNet: MR3082036
Digital Object Identifier: 10.1155/2013/836395

Rights: Copyright © 2013 Hindawi

JOURNAL ARTICLE
7 PAGES


SHARE
Vol.2013 • 2013
Back to Top