Question 130
There is a graph with 30 vertices. If any 26 of its vertices with their outgoing edges are deleted, then the remaining graph is a connected graph with 4 vertices.
What is the smallest number of the edges in the initial graph with 30 vertices?
What is the smallest number of the edges in the initial graph with 30 vertices?