Edge-neighbor-rupture degree of graphs

Simple item page
dc.contributor.authorAslan E.
dc.date.accessioned2024-07-22T08:18:17Z
dc.date.available2024-07-22T08:18:17Z
dc.date.issued2013
dc.description.abstractThe edge-neighbor-rupture degree of a connected graph G is defined to be ENRG=maxωG-S-S-mG-S:SEG,ωG-S≥1, where S is any edge-cut-strategy of G, ωG-S is the number of the components of G-S, and mG-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. © 2013 Ersin Aslan.
dc.identifier.DOI-ID10.1155/2013/783610
dc.identifier.issn16870042
dc.identifier.urihttp://akademikarsiv.cbu.edu.tr:4000/handle/123456789/17258
dc.language.isoEnglish
dc.rightsAll Open Access; Gold Open Access
dc.titleEdge-neighbor-rupture degree of graphs
dc.typeArticle

Files

Collections

Scopus Koleksiyonu