Further Research of k-Threshold Close Assignment
Jiezhi Wang · Natural Science Journal of Xiangtan University · 2010
The graph with k-threshold close assignment has many exquisite properties,which is applied to the research of social network.Roberts and Li Sheng proved that every graph with k vertices at least is k-threshold close assignable when k=1,2,3,4,5.Our work shows that almost every graph is 7-threshhold close assignable and derives a method to distinguish whether a graph is 7-threshhold close assignable which resolves the problem.