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...

Full description

Saved in:
Bibliographic Details
Published inNational Academy science letters Vol. 41; no. 4; pp. 233 - 238
Main Authors Sinha, Deepa, Sharma, Deepakshi
Format Journal Article
LanguageEnglish
Published New Delhi Springer India 01.08.2018
Springer Nature B.V
Subjects
Graph theory
History of Science
Humanities and Social Sciences
multidisciplinary
Network analysis
Properties (attributes)
Science
Science (multidisciplinary)
Short Communication
Social networks
Social organization
Signed graph
Signed-regularity
Signed social network
Social network
Marked signed graph
Closed neighborhood
Sign-compatibility
Square signed graph
Algorithm
Clusterability
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0250-541X
2250-1754
DOI:10.1007/s40009-018-0643-0