Edge-Neighbor-Rupture Degree of Graphs
No Thumbnail Available
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
The edge-neighbor-rupture degree of a connected graph G is defined to be ENR(G) = max{omega(G - S) - vertical bar S vertical bar - m(G - S) : S subset of E(G), omega(G - S) >= 1}, where S is any edge-cut-strategy of G, omega (G - S) is the number of the components of G - S, and m(G - S) is the maximum order of the components of G - S. 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.