Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 82, 2005 - Issue 1
Submit an article Journal homepage
189
Views
4
CrossRef citations to date
0
Altmetric
Miscellany

Vulnerability in graphs: the neighbour-integrity of line graphs

Vecdi AytaçCorrespondence[email protected]
Pages 35-40 | Received 27 Jun 2003, Accepted 29 Jun 2004, Published online: 25 Jan 2007
 
Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days

Abstract

The vulnerability of a graph is a determination that includes certain properties of the graph not to be damaged after the removal of a number of vertices or edges. One measure of vulnerability to vertex removal is neighbour-integrity. The vertex-neighbour-integrity is a measure of the vulnerability of graphs to disruption caused by the removal of vertices and all of their adjacent vertices. In this article we consider vertex removal and give some results on the neighbour-integrity of line graphs.

Log in via your institution

Access through your institution

Log in to Taylor & Francis Online

Restore content access

Restore content access for purchases made as guest
Purchase options * Save for later

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.