Edge-rupture degree of a graph
| dc.contributor.author | Aslan E. | |
| dc.date.accessioned | 2024-07-22T08:14:22Z | |
| dc.date.available | 2024-07-22T08:14:22Z | |
| dc.date.issued | 2015 | |
| dc.description.abstract | The 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. | |
| dc.identifier.issn | 14928760 | |
| dc.identifier.uri | http://akademikarsiv.cbu.edu.tr:4000/handle/123456789/16566 | |
| dc.language.iso | English | |
| dc.publisher | Watam Press | |
| dc.title | Edge-rupture degree of a graph | |
| dc.type | Article |