An edge e of a k-connected graph G is said to be a removable edge if G Θ e is still k-connected,where G Θ e denotes the graph obtained from G by the following way: deleting e to get G - e, and for any end vertex of e with degree k -1 in G - e, say x, deleting x, and then adding edges between any pair of non-adjacent vertices in NG - e(x). The existence of removable edges of k-connected graphs and some properties of k-connected graphs have been investigated. In the present paper, we investigate the distribution of removable edges on a spanning tree of a k-connected graph(k ≥ 4).
