Question

a
D. Show that a graph with n
vertices and with vertices
connectively k must be have
at least
show
that the degree of
k I edges. Further
every vertex in a nonseperable graph is at least two​

Answer 1

Answer:

please mark as brainleast