Minimise the maximum degree of a vertex in a connected graph

201 Views Asked by At

Given N vertices and M edges, how to create a connected graph so that I can minimize the maximum degree of every vertex. A vertex can have at most degree N (self loop and other N-1 edges). Find the maximum degree of vertex in all such possible graphs. Consider all possible values of N and M.