137
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

Vertex-neighbour-integrity of composition graphs of paths and cycles

&
Pages 727-733 | Received 21 Oct 2005, Accepted 26 Apr 2007, Published online: 24 Apr 2008
 

Abstract

A vertex subversion strategy of a graph G is a set of vertices XV(G) whose closed neighbourhood is deleted from G. The survival subgraph is denoted by G/X. The vertex-neighbour-integrity of G is defined to be VNI(G)=min{|X|+τ(G/X):XV(G)}, where τ(G/X) is the maximum order of the components of G/X. This graph parameter was introduced by Cozzens and Wu to measure the vulnerability of spy networks. Gambrell proved that the decision problem of computing the vertex-neighbour-integrity of a graph is 𝒩𝒫-complete. In this paper we evaluate the vertex-neighbour-integrity of the composition graphs of paths and cycles.

CCS Category::

Acknowledgements

This work was supported by NSFC (No.60642002), SRF for ROCS of SEM, and BSF (No.AJ12046) of XAUAT. The authors are grateful to the anonymous referees for helpful comments on an earlier version of this article.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 1,129.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.