Edge-Neighbor-Rupture Degree of Graphs

Ersin Aslan

Journal of Applied Mathematics, 2013, vol. 2013, 1-5

Abstract:

The edge-neighbor-rupture degree of a connected graph is defined to be , where is any edge-cut-strategy of , is the number of the components of , and is the maximum order of the components of . 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)
http://downloads.hindawi.com/journals/JAM/2013/783610.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2013/783610.xml (text/xml)

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:hin:jnljam:783610

DOI: 10.1155/2013/783610

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().