proof of the graph with 13 vertices and 96 edges satisfies minimum number of required edges for a graph to be connected
Introduction : We shall provide the proof of the graph with 13 vertices and 96 edges satisfies minimum number of required edges for a graph to be connected. First we…