Question $1(1$ point$)$

There are $7$ secret service agents dispersed around the world and to maintain their secrecy$,$ each agent can communicate only with select agents. This is indicated in the map below where $1$ means two agents can contact each other, and $0$ means they cannot. However, the agency realizes that there is probably a lot of redundant communication channels and this is risky. So$,$ they engage you to develop a minimal set of communication channels plan such that if an information is with one agent, it can be communicated to everyone else. Solve this problem using graph theory.