A graph \(G\)  consisting of \(n\)  agents can be captured mathematically [1]} by the associated Laplacian matrix \(L_n(G)\)  of order \(n\) . In this work, all the graphs are assumed as undirected with bidirectional inter-agent communication links.
