Figure 1.

A team of 13 searching agents connected with different communication networks: (a) $R_{\max }=1.1d$; and (b) $R_{\max }=2d$. d is the smallest distance between the agents. Both communication graphs are connected.