Neighbour isolated scattering number of graphs

Creative Commons License

ASLAN E.

ScienceAsia, cilt.41, sa.6, ss.423-431, 2015 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 41 Sayı: 6
  • Basım Tarihi: 2015
  • Doi Numarası: 10.2306/scienceasia1513-1874.2015.41.423
  • Dergi Adı: ScienceAsia
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.423-431
  • Anahtar Kelimeler: graph theory, vulnerability, neighbour connectivity, neighbour scattering number
  • Manisa Celal Bayar Üniversitesi Adresli: Evet

Özet

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.