In the literature of graph theory, networks are represented as directed graphs or undirected graphs and a mixed of both com-binations. In today’s era of computing, networks like brain and facebook that do not belong to any of the mentioned networks category and in fact, it belongs to the combination of both networks which have connections as directed as well as undirected. To represent such networks, semi-directed graphs have been studied in this paper that provides the detailed mathematical fun-damentals related to better understand the conceptualization for social media networks. This paper also discusses the suitable matrices analyze for the representation of the graphs. Few new terminologies like incidence number, complete-incidence related to semi-directed graphs and counter isomorphism of semi-directed graphs have been inculcated. A centrality measure, namely incidence centrality, has also been proposed based on incidence number on neighbors in social media networks.
CITATION STYLE
Samanta, S., Pal, M., Mahapatra, R., Das, K., & Bhadoria, R. S. (2021). A study on semi-directed graphs for social media networks. International Journal of Computational Intelligence Systems, 14(1), 1034–1041. https://doi.org/10.2991/IJCIS.D.210301.001
Mendeley helps you to discover research relevant for your work.