Aslan E.2025-04-102025-04-102015http://hdl.handle.net/20.500.14701/49392The edge-rupture degree of a noncomplete connected graph G is defined to be r'(G) = max{ω(G - S) - |S| - m(G - S): S ⊆ E(G), ω(G - S) > 1} where ω(G - S) denote the number of components and m(G - S) denote the order of a largest component in G - S. In this paper, the relations between edge-rupture degree and other parameters are determined, and the edge-rupture degree of some graphs are obtained. Copyright © 2015 Watam Press.Article