On the Properties of Square Signed Graph
Social network analysis has been a subject of interest to many sociologists, computer scientists, psychologists and mathematicians for many centuries now. Lately another aspect of the social network, specific kind of links (friendship/enmity, trust/distrust, like/dislike) has been studied vigorously. In this paper, we try to explore and analyse these networks mathematically by taking a small subnetwork and predicting its properties and behaviour. Let \(G=(V,E)\) be a graph then square graph of G is obtained by adding to G edges which connect pairs of vertices of G at a distance two apart. In this paper we discuss few properties of square signed graphs along with their algorithms.
KeywordsSocial network Signed social network Signed graph Marked signed graph Square signed graph Closed neighborhood Sign-compatibility Signed-regularity Clusterability Algorithm
Authors wish to thank Prof Mukti Acharya and the referees for going through the paper for the suggestions and improvement of the paper.
- 2.West DB (2001) Introduction to graph theory, vol 2. Prentice Hall, Upper Saddle RiverGoogle Scholar
- 14.Leskovec J, Huttenlocher D, Kleinberg J (2010) Signed networks in social media. In: Proceedings of the SIGCHI conference on human factors in computing systems. ACM, pp 1361–1370Google Scholar
- 15.Sinha D, Sethi A (2017) An optimal algorithm to detect clusterability of a given sigraph. ManuscriptGoogle Scholar
- 16.Sinha D, Sharma D (2017) Algorithm characterization of square signed graph and its balance property (Preprint) Google Scholar