(n - 1)-role assignments on G_n~(d,s) graphs
Yongqiang Li · Hebei Sheng Kexueyuan xuebao · 2005
Everett and Borgatti introduced role assignments. Further more, they introduced the measurement of k-role assignments of the graph G to show how close the graph is k-role assignable,i, e. αk(G). They even gave the infimum of α2( G) and showed when αk2( G) reached the infimum. In this paper,we introduce the Gnd,s graph.For k≥3,we show the infimum of αkk(G) is 0 and adduce the Gk+1l,s graph is which causes αk(G) =0;using the foregone conclusion we characterize the Gk+1 1,s graph which has a k-role assignment.