Edge-Neighbor-Rupture Degree of Graphs
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 e...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2013-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2013/783610 |
| Summary: | 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. |
|---|---|
| ISSN: | 1110-757X 1687-0042 |