How many simple graph with $n$ vertices (labeled) and every vertex of it has at least $2$ edges?
I have established some views of simple graph with $4$ vertices, but somehow I found a trouble to apply combinatorics method, counting how many graph satisfies the condition. Could you give me some help?