The analysis of split graphs in social networks based on the k-cardinality assignment problem

Abstract

In terms of social networks, split graphs correspond to the variety of interpersonal and intergroup relations. In this paper we analyse the interaction between the cliques (socially strong and trusty groups) and the independent sets (fragmented and non-connected groups of people) as the basic components of any split graph. Based on the Semi-Lagrangean relaxation for the k-cardinality assignment problem, we show the way of minimizing the socially risky interactions between the cliques and the independent sets within the social network.