A note on extremal values of the scattering number

Peter Dankelmann, Wayne Goddard, Charles A. McPillan, Henda C. Swart

Research output: Contribution to journalArticlepeer-review


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) - {pipe}S{pipe} 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.

Original languageEnglish
Pages (from-to)1651-1658
Number of pages8
JournalTaiwanese Journal of Mathematics
Issue number5
Publication statusPublished - 2013


  • Graph
  • Scattering number
  • Toughness
  • Triangle-free

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'A note on extremal values of the scattering number'. Together they form a unique fingerprint.

Cite this