Shi Ying WANG, Yu Xing YANG, Shang Wei LIN, Jing LI, Zhi Ming HU
The isolated scattering number isc(G) = max{i(G - S) - |S| : S ∈ C(G)}, where G is a connected graph, i(G - S) is the number of isolated vertices of G - S and C(G) is the set of vertex cuts of G. In this paper, we investigate the relationships between the isolated scattering number and other parameters of a graph G, and discuss the graphs with special isolated scattering numbers. We prove that the isolated scattering numbers of a cycle, a connected bipartite graph, the join of connected bipartite graphs and the complement of a tree and a cycle are minimal, and give the maximum and minimum isolated scattering numbers of trees with given order and maximum degree.