Question: Suppose a graph has 8 vertices and is connected. Three of those vertices have degree 6, and the rest have degree 2. Then we can

Suppose a graph has 8 vertices and is connected. Three of those vertices have degree 6, and the rest have degree 2. Then we can conclude the following. There must be [Select ] edges in the graph. The graph has [Select ]

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!