Question

given a simple graph g, what is the minimum possible degree that a vertex can have, and what is the maximum possible degree that a vertex can have?

Answer 1

The minimum possible degree that a vertex can have is 0 and the maximum possible degree is (n-1), where n is the total number of vertices in the graph.

Step-by-step explanation:

The minimum possible degree that a vertex can have in a simple graph is 0, which means the vertex is not connected to any other vertex in the graph. The maximum possible degree that a vertex can have is n-1, where n is the total number of vertices in the graph. In other words, it is the highest possible number of edges that can be incident to a single vertex.