Computing closeness for some graphs

[1] A. Aytac, Z. N. Odabas, Residual closeness of wheels and related networks, International Journal of Foundations of Computer Science, 22, 5 (2011) 1229–1240. doi:10.1142/S0129054111008660. ⇒223, 224 Search in Google Scholar

[2] A. Aytac, H. AksuÖztürk, Graph theory for big data analytics, Journal of the International Mathematical Virtual Institute, 10, 2 (2020) 325–3390. doi:10.7251/JIMVI2002325A. ⇒223 Search in Google Scholar

[3] A. Aytac, Relevant graph concepts for big data, Journal of Modern Technology and Engineering, 5, 3 (2020) 255–263. ⇒223 Search in Google Scholar

[4] V. Aytac, T. Turaci, Closeness centrality in some splitting networks. Computer Science Journal of Moldova, 26, 3 (2018) 251–269. ID: 57760763. ⇒224 Search in Google Scholar

[5] A. Bavelas, A mathematical model for small group structures, Human Organization, 7, (1948) 16–30. ⇒223 Search in Google Scholar

[6] F. Buckley, F. Harary, Distance in Graphs, Addison Wesley Publishing Company, Redwood City, CA 1990. ⇒223 Search in Google Scholar

[7] G. Chartrand, L. Lesniak, Graphs and Digraphs: (4th Edition), Chapman and Hall/CRC Inc., Boca Raton, Fl., 2005. ⇒223 Search in Google Scholar

[8] Ch. Dangalchev, Residual closeness in networks, Physica A Statistical Mechanics and Its Applications, 365, 2006 556–564. ⇒223, 224, 226, 230, 231 Search in Google Scholar

[9] Ch. Dangalchev, Residual Closeness and Generalized Closeness, International Journal of Foundations of Computer Science, 22, 8 (2011) 1939–1948. ⇒223 Search in Google Scholar

[10] Ch. Dangalchev, Closeness of splitting graphs, C. R. Acad. Bulg. Sci. 73, 4 2020 461–466. ⇒224, 225 Search in Google Scholar

[11] K. M. Koh, D. G. Rogers, H. K. Teo, K. Y. Yap, Graceful graphs: some further results and problems, Congress. Numer., 29 (1980) 559–571. ⇒230 Search in Google Scholar

[12] L.C. Freeman, Centrality in social networks: conceptual clarification, Social Networks 1, (1979) 215–239. ⇒223 Search in Google Scholar

[13] S. Havlin, D.Y. Kenett, E. Ben-Jacob, A. Bunde, R. Cohen, H. Hermann, J.W. Kantelhardt, J. Kertész, S. Kirkpatrick, J. Kurths, J. Portugali, S. Solomon, Challenges in network science: Applications to infrastructures, climate, social systems and economics, Eur. Phys. J. Spec. Top. 214, (2012) 273–293. ⇒222 Search in Google Scholar

[14] S. Jin, Z. Huang, Y. Chen, D. G. Chavarría-Miranda, J. Feo, P. C. Wong, A novel application of parallel betweenness centrality to power grid contingency analysis, 2010 IEEE International Symposium on Parallel and Distributed Processing (IPDPS), Atlanta, GA, USA, 2010, 1–7. doi:10.1109/IPDPS.2010.5470400. ⇒222 Search in Google Scholar

[15] V. Latora, M. Marchiori, E cient behavior of small-world networks, Phys. Rev. Lett. 87, 19 (2001) 198701. ⇒223 Search in Google Scholar

[16] E. L. Merrer, G. Trédan., Centralities: Capturing the fuzzy notion of importance in social graphs, SNS ’09: Proceedings of the Second ACM EuroSys Workshop on Social Network Systems, 2009, pp. 33–38, doi:/10.1145/1578002.1578008. ⇒222 Search in Google Scholar

[17] J. Mycielski, Sur le coloriage des graphs, Colloq. Math., 3 (1955), 161–162. ⇒223 Search in Google Scholar

[18] M. C. Pham and R. Klamma, The structure of the computer science knowledge network, ASONAM’10: Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining, 2010, doi:10.1109/ASONAM.2010.58. ⇒222 Search in Google Scholar

[19] S. Porta, V. Latora, F. Wang, E. Strano, A. Cardillo, S. Scellato, V. Iacoviello, Messora, Street centrality and densities of retail and services in Bologna, Italy, Environment and Planning B: Planning and Design, 36, 3 (2009), 450–465. ⇒222 Search in Google Scholar

[20] S. H. Strogatz, Exploring complex networks, Nature, 410 (2001), 268–276. ⇒222 Search in Google Scholar

[21] M. Truszczyńnski, Graceful Unicyclic Graphs, Demonstatio Math., 17 (1984) 377-387. ⇒230 Search in Google Scholar

[22] T. Turaci, M. Okten, Vulnerability of Mycielski graphs via residual closeness Ars Combinatoria 118 (2015). 419–427. ⇒224, 225, 226, 236 Search in Google Scholar

[23] T. Turaci, V. Aytac, Residual closeness of splitting networks, Ars Combinatoria 130 (2017) 17–27. ⇒224 Search in Google Scholar

[24] X. F. Wang, X. Li, G. R. Chen, Complex Networks Theory and its Application, Tsinghua University Press, Beijing, 2006. ⇒222 Search in Google Scholar

[25] J. S. Wang, X. P. Wu, B. Yan, J.W. Guo, Improved method of node importance evaluation based on node contraction in complex networks, Procedia Eng., 15 (2011) 1600–1604. ⇒222 Search in Google Scholar

[26] D.J. Watts and SH. Strogatz, Collective dynamics of ‘small-world’ networks, Nature, 393 (1998) 440–442. ⇒222 Search in Google Scholar

[27] Z.N. Odabas, A. Aytac, Residual closeness in cycles and related networks, Fundamenta Informaticae, 124, 3 (2013) 297–307. doi:10.3233/FI-2013-835. ⇒223 Search in Google Scholar

[28] Y.C. Zhang, Y. Liu, H.F. Zhang, H. Cheng, F. Xiong, The research of information dissemination model on online social network, Acta Phys. Sinica, 60 (2011) 050501. ⇒222 Search in Google Scholar