286 views
0 votes
0 votes

I am getting n>=9 ,if I  consider remaining vertices degree 2 (less than 3). How ans is this small ?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
suneetha asked Nov 23, 2018
258 views
consider a complete garph on 2^(log(2^10)) vertices then the minimum number of edge removal operations needed to make graph disconnected
0 votes
0 votes
0 answers
2
Dipanshu Rana asked Nov 22, 2018
166 views
How many spanning trees of K(n) (labelled)?? K(n) is complete graph with n vertices
0 votes
0 votes
0 answers
3
Dipanshu Rana asked Nov 22, 2018
222 views
How many labelled trees with n vertices
0 votes
0 votes
0 answers
4
Dipanshu Rana asked Nov 22, 2018
140 views
How many simple labelled graphs with n vertices and e edges