Graph Theoryeasy
0:00.0

A connected graph GG has V=8V=8 vertices and E=7E=7 edges. What is the maximum number of leaves (vertices of degree 1) this graph could have?