Open Access
2013 Edge-Neighbor-Rupture Degree of Graphs
Ersin Aslan
J. Appl. Math. 2013: 1-5 (2013). DOI: 10.1155/2013/783610


The edge-neighbor-rupture degree of a connected graph G is defined to be ENRG=maxωGSSmGS:SEG,ωGS1, where S is any edge-cut-strategy of G, ωGS is the number of the components of GS, and mGS is the maximum order of the components of GS. In this paper, the edge-neighbor-rupture degree of some graphs is obtained and the relations between edge-neighbor-rupture degree and other parameters are determined.


Download Citation

Ersin Aslan. "Edge-Neighbor-Rupture Degree of Graphs." J. Appl. Math. 2013 1 - 5, 2013.


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

zbMATH: 06950866
MathSciNet: MR3096064
Digital Object Identifier: 10.1155/2013/783610

Rights: Copyright © 2013 Hindawi

Vol.2013 • 2013
Back to Top