Question

The number of edges in a graph G if 3 vertices are of degree 4, 2 vertices are of degree 3and other 4 vertices of degree 1.​

Answer 1

A graph G has only vertices of degree 3 and degree 4 and is decomposable into two spanning trees.