Abstract
Let G be a graph. A vertex subversion strategy of G, S, is a set of vertices in G whose closed neighborhood is deleted from G. The survival-subgraph is denoted by G/S. The vertex-neighbor-integrity of G, VNI(G), is denned to be VNI(G) = minSCV(G) {|S| + ω(G/S)}, where S is any vertex subversion strategy of G, and ω(G/S) is the maximum order of the components of G/S. In this paper, we discuss the relationship between the vertex-neighbor-integrity and some well-known graphic parameters.
Original language | American English |
---|---|
Pages (from-to) | 271-282 |
Number of pages | 12 |
Journal | Ars Combinatoria |
Volume | 55 |
State | Published - Apr 2000 |
Externally published | Yes |
ASJC Scopus subject areas
- General Mathematics