Question: Discrete Math graphs Suppose that G is a simple graph that G has exactly 7 vertices; Every vertex of G has degree at least 1;

Discrete Math graphs

Suppose that G is a simple graph that

  • G has exactly 7 vertices;
  • Every vertex of G has degree at least 1;
  • G is not connected

What is the:

Maximum number of edges G could have?

Minimum number of edges G could have?

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!