Let G be a strongly connected digraph, and dG(vi,vj) denote the distance from vertex vi to vj defined as length of shortest directed path in G. The sum between vertices is sdG(vi,vj)=dG(vi,vj)+dG(vj,vi). matrix n×n SD(G)=(sdG(vi,vj))vi,vj∈V(G). For vi∈V(G), transmission G, denoted by STG(vi) or STi, row SD(G) corresponding vi. ST(G)=diag(ST1,ST2,…,STn) diagonal with transmissions zeroes elsewhe...