Abstract
Let G be a graph. An edge subversion strategy of G is a set of edges T in G whose incident vertices are deleted from G. The survival-subgraph is denoted by G/T. The edge-neighbor-integrity of G. ENI(G). is defined to be ENI(G) = min {|T| + ω(G/T)}, where T is anv edge subversion strategv of G. and ω(G/T) is the maximum order of the components of G IT. In this paper. we find the lower and upper bounds of ENI for all graphs related to some well-known graphic parameters. and we also discuss some properties of the graphs with ENI equal to the bounds.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 71-80 |
| Number of pages | 10 |
| Journal | Australasian Journal of Combinatorics |
| Volume | 15 |
| State | Published - 1997 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics