| Home  | About ScienceAsia  | Publication charge  | Advertise with us  | Subscription for printed version  | Contact us  
Editorial Board
Journal Policy
Instructions for Authors
Online submission
Author Login
Reviewer Login
Volume 49 Number 4
Volume 49 Number 3
Volume 49 Number 2
Volume 49 Number 1
Volume 48 Number 6
Volume 48 Number 5
Earlier issues
Volume 41 Number 5 Volume 41 Number 6 Volume 42 Number 1

previous article

Research articles

ScienceAsia 41 (2015): 423-431 |doi: 10.2306/scienceasia1513-1874.2015.41.423

Neighbour isolated scattering number of graphs

Ersin Aslan

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 to be 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.

Download PDF

29 Downloads 1381 Views

Turgutlu Vacational School, Celal Bayar University, Manisa, Turkey

* Corresponding author, E-mail: ersin.aslan@cbu.edu.tr

Received 31 Mar 2015, Accepted 15 Oct 2015