On k+1 separation of graphs by removal edges
by
Tiang Poomsa-ard
Khon Kaen University

Goldsmith, Mavel and Faber introduced graphical parameters that count the number of edges removed to separate a connected graph into three components, called obvious triple separation and greedy triple separation. The k^th order edge-connectivity \lambda^(k)(G) of a graph G is defined to be the smallest number of edges whose removal leave a graph with k+1 conponents. In this talk, we defined the greedy k+1 separation denoted by \sigma^(k)(G) and present some results on the relationship between \lambda^(k)(G) and \sigma^(k)(G).

Date received: November 7, 2000