Edge-Neighbor-Scattering Number of Graphs

Abstract

The edge-neighbor-scattering number of a graph \(G\) is defined to be \(EN_S(G) = \max\limits_{S\subseteq E(G)}\{w(G/S) -\mid |S|\}\) where \(S\) is any edge-cut-strategy of \(G\), \(w(G/S)\) is the number of the components of \(G/S\). In this paper, we give edge-neighbor-scattering number of some special classes of graphs, and then mainly discuss the general properties of the parameter.