Neighbour isolated scattering number of graphs

Creative Commons License

ASLAN E.

ScienceAsia, vol.41, no.6, pp.423-431, 2015 (SCI-Expanded, Scopus) identifier identifier

  • Publication Type: Article / Article
  • Volume: 41 Issue: 6
  • Publication Date: 2015
  • Doi Number: 10.2306/scienceasia1513-1874.2015.41.423
  • Journal Name: ScienceAsia
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.423-431
  • Keywords: graph theory, vulnerability, neighbour connectivity, neighbour scattering number
  • Open Archive Collection: AVESIS Open Access Collection
  • Manisa Celal Bayar University Affiliated: Yes

Abstract

The scattering number is a measure of the vulnerability of a graph. In this paper we investigate a refinement that involves the neighbour isolated version of the parameter. The neighbour isolated scattering number of a noncomplete graph G is defined tobe NIS(G) = max{i(G/X)-|X|: i(G/X) ≥ 1} where the maximum is taken over all X, the cut strategy of G, and i(G/X) is the number of components which are isolated vertices of G/X. Like the scattering number itself, this is a measure of the vulnerability of a graph, but it is more sensitive. The relations between neighbour isolated scattering number and other parameters are determined and the neighbour isolated scattering number of trees and other families are obtained. We also give some results for the neighbour isolated scattering number of the graphs obtained by some graph operations.