The neighbour-integrity of total graphs
Articles > Article · 2000
Authors: Alpay KIRLANGIÇ, Aysun OZAN
International Journal of Computer Mathematics, Journal Indexed in SCI Expanded, International, WoS, 2000, vol 76, pp 25-33
DOI: 10.1080/00207160008805006
Summary
Let Gbe a graph. A vertex subversion strategy of G, say S, is a set of vertices in G whose closed neighbourhood is removed from G. The survival-subgraph is denoted by G/S. The neighbour-integrity of G NI(G), is defined to be , where S is any vertex subversion strategy of G, and c(G/S) is the maximum order of the components of G/S. This paper includes results on the neighbour-integrity of total graphs.