Bounds of edge-neighbor-integrity of graphs
Margaret B. Cozzens, Shu Shih Y. Wu · 1997
Abstract. Let G be a graph. An edge subversion strategy of G is a set of edges T in G \\vhose incident vertices are deleted from G. The survival-subgraph is denoted by G IT. The edge-neighbor-integrity of G. ENI ( G). is defined to be ENI ( G) = min {ITI + w' ( G/T)}, where T is anv edge subversion strategv of G. and w' ( G/T) T~E(G) • • 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. I.