Skip to main content
SpringerLink
Log in

On the Properties of Square Signed Graph

  • Short Communication
  • Published:
National Academy Science Letters Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

References

  1. Harary F (1969) Graph theory. Addision Wesley, Reading

    Book  MATH  Google Scholar 

  2. West DB (2001) Introduction to graph theory, vol 2. Prentice Hall, Upper Saddle River

    Google Scholar 

  3. Zaslavsky T (2012) A mathematical bibliography of signed and gain graphs and allied areas. Electron J Combin 1000:8

    MathSciNet  Google Scholar 

  4. Cartwright D, Harary F (1956) Structural balance: a generalization of Heider’s theory. Psychol Rev 63(5):277

    Article  PubMed  CAS  Google Scholar 

  5. Zaslavsky T (1982) Signed graph coloring. Discret Math 39(2):215–228

    Article  MathSciNet  MATH  Google Scholar 

  6. Mukhopadhyay A (1967) The square root of a graph. J Combin Theory 2(3):290–295

    Article  MathSciNet  MATH  Google Scholar 

  7. Sinha D, Garg P (2011) On the regularity of some signed graph structures. AKCE Int J Graphs Combin 8(1):63–74

    MathSciNet  MATH  Google Scholar 

  8. Zaslavsky T (1991) Orientation of signed graphs. Eur J Combin 12(4):361–375

    Article  MathSciNet  MATH  Google Scholar 

  9. Sinha D, Dhama A (2013) Sign-compatibility of some derived signed graphs. Indian J Math 55(1):23–40

    MathSciNet  MATH  Google Scholar 

  10. Sinha D, Sethi A (2015) An optimal algorithm to detect sign compatibility of a given sigraph. Natl Acad Sci Lett 38(3):235–238

    Article  MathSciNet  CAS  Google Scholar 

  11. Doreian P, Mrvar A (2009) Partitioning signed social networks. Soc Netw 31(1):1–11

    Article  MATH  Google Scholar 

  12. Davis JA (1967) Clustering and structural balance in graphs. Hum Relat 20(2):181–187

    Article  Google Scholar 

  13. Yang B, Cheung WK, Liu J (2007) Community mining from signed social networks. IEEE Trans Knowl Data Eng 19(10):1333–1348

    Article  Google 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–1370

  15. Sinha D, Sethi A (2017) An optimal algorithm to detect clusterability of a given sigraph. Manuscript

  16. Sinha D, Sharma D (2017) Algorithm characterization of square signed graph and its balance property (Preprint)

Download references

Acknowledgements

Authors wish to thank Prof Mukti Acharya and the referees for going through the paper for the suggestions and improvement of the paper.

Author information

Authors and Affiliations

  1. Department of Mathematics, South Asian University, Akbar Bhawan Chanakyapuri, New Delhi, 110021, India

    Deepa Sinha & Deepakshi Sharma

Authors
  1. Deepa Sinha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Deepakshi Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Deepa Sinha.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sinha, D., Sharma, D. On the Properties of Square Signed Graph. Natl. Acad. Sci. Lett. 41, 233–238 (2018). https://doi.org/10.1007/s40009-018-0643-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40009-018-0643-0

Keywords

Search

Navigation