“…Consider a network of 14 agents whose edge set is given by šø 1 = {(š£ 1 , š£ 2 ), (š£ 1 , š£ 3 ), (š£ 2 , š£ 3 ), (š£ 3 , š£ 2 ), (š£ 3 , š£ 9 ), (š£ 3 , š£ 11 ), (š£ 4 , š£ 5 ), (š£ 5 , š£ 6 ), (š£ 5 , š£ 7 ), (š£ 6 , š£ 7 ), (š£ 7 , š£ 4 ), (š£ 7 , š£ 5 ), (š£ 7 , š£ 11 ), (š£ 8 , š£ 9 ), (š£ 8 , š£ 14 ), (š£ 9 , š£ 10 ), (š£ 10 , š£ 11 ), (š£ 10 , š£ 14 ), (š£ 11 , š£ 12 ), (š£ 11 , š£ 14 ), (š£ 12 , š£ 13 ), (š£ 12 , š£ 14 ), (š£ 13 , š£ 12 )}. (12) Since there is no spanning tree in the graph š® š = (š½ š , š¬ š ), multiple groups will be formed in the network. Once the directed edges are entered as inputs to GraParT, Figure 2 illustrates the network graph, the reduced graph; the PLS and SLS of š® š , and evolutions of the states of the agents as functions of time.…”