Laddar...
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...
Sparad:
| Huvudupphovsman: | |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Publicerad: |
Hindawi Limited
2013-01-01
|
| Serie: | Journal of Applied Mathematics |
| Länkar: | http://dx.doi.org/10.1155/2013/783610 |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|