1. Graph operations and neighbor-integrity
- Creator:
- Kırlangıc, Alpay
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- vulnerability, integrity, and neighbor-integrity
- Language:
- English
- Description:
- Let G be a graph. A vertex subversion strategy of G, say S, is a set of vertices in G whose closed neighborhood is removed from G. The survival-subgraph is denoted by G/S. The Neighbor-Integrity of G, NI(G), is defined to be NI(G) = min S⊆V (G) {|S| + c(G/S)}, where S is any vertex subversion strategy of G, and c(G/S) is the maximum order of the components of G/S. In this paper we give some results connecting the neighbor-integrity and binary graph operations.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public