On Edge Cut of Graphs Leaving Components of Order at Least Five