Edge‐Neighbor‐Rupture Degree of Graphs

Ersin Aslan

Journal of Applied Mathematics, 2013, vol. 2013, issue 1

Abstract: The edge‐neighbor‐rupture degree of a connected graph G is defined to be ENR(G) = max{ω(G − S) − |S| − m(G − S) : S⊆E(G), ω(G − S) ≥ 1}, where S is any edge‐cut‐strategy of G, ω(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.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2013/783610

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2013:y:2013:i:1:n:783610

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().