Abstract
Let $c(H)$ denote the number of components of graph $H$. The scattering number of a graph $G$ is the maximum of $c(G-S)-|S|$ taken over all cut-sets $S$ of $G$. In this note we explore the minimum and maximum scattering number for several families. For example, we show that the minimum scattering number of a triangle-free graph on $n$ vertices is approximately $-n/3$. We also consider the scattering number of some graph products.
Citation
Wayne Goddard. Peter Dankelmann. Charles A. McPillan. Henda C. Swart. "A NOTE ON EXTREMAL VALUES OF THE SCATTERING NUMBER." Taiwanese J. Math. 17 (5) 1651 - 1658, 2013. https://doi.org/10.11650/tjm.17.2013.2583
Information