Edge-neighbor-rupture degree of graphs
| dc.contributor.author | Aslan E. | |
| dc.date.accessioned | 2025-04-10T11:14:02Z | |
| dc.date.available | 2025-04-10T11:14:02Z | |
| dc.date.issued | 2013 | |
| dc.description.abstract | The 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-ID | 10.1155/2013/783610 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.14701/50082 | |
| dc.title | Edge-neighbor-rupture degree of graphs | |
| dc.type | Article |