![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
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.
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.