Relationships between vertex-neighbor-integrity and other parameters

Margaret B. Cozzens, Shu Shih Y. Wu

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

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 languageAmerican English
Pages (from-to)271-282
Number of pages12
JournalArs Combinatoria
Volume55
StatePublished - Apr 2000
Externally publishedYes

ASJC Scopus subject areas

  • General Mathematics

Fingerprint

Dive into the research topics of 'Relationships between vertex-neighbor-integrity and other parameters'. Together they form a unique fingerprint.

Cite this