How to connect 50 cities with the smallest number of air routes so that you can travel from any city to any other, making no more than two transfers?

#
Let's highlight one city and connect it by air routes to each of the other 49 cities. For this, 49 air routes will be required.

A smaller number of air routes cannot suffice. Indeed, according to problem 31098 g), in a connected graph with 50 vertices, there are no fewer than 49 edges.