Edge-Neighbor-Rupture Degree of Graphs
| dc.contributor.author | Aslan, E | |
| dc.date.accessioned | 2024-07-18T11:47:16Z | |
| dc.date.available | 2024-07-18T11:47:16Z | |
| dc.description.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. | |
| dc.identifier.issn | 1110-757X | |
| dc.identifier.uri | http://akademikarsiv.cbu.edu.tr:4000/handle/123456789/3372 | |
| dc.language.iso | English | |
| dc.publisher | HINDAWI PUBLISHING CORPORATION | |
| dc.subject | SCATTERING NUMBER | |
| dc.subject | CONNECTIVITY | |
| dc.subject | INTEGRITY | |
| dc.title | Edge-Neighbor-Rupture Degree of Graphs | |
| dc.type | Article |