A simple program to prove whether a graph with certain properties exist
What is the minimum size n(number of vertices) such that a network has distinct vertices that hold the status of highest centrailty (No ties allowed). Centrailties set: (degree, betweenness, harmonic and eigenvector centralities).