Closeness Centrality Weight of Graphs Under Some Graph Operations
DOI:
https://doi.org/10.26713/cma.v16i2.2948Keywords:
Centrality measures, Closeness centrality weightAbstract
Many complex systems exhibit a natural hierarchy in which elements can be ordered according to a notion of influence with closeness centrality being one of the three well-known centrality measures used in social network analysis, determining the importance of vertices in a network, a core task in each network application. It describes the relative importance of a single vertex within a network or graph by finding the average proximity of that vertex to all others in that graph. In this paper, we derive formulae for the closeness centrality weight of the graph resulting from the operations between some graph families namely, join graph, Cartesian product of graph, shadow graph, corona graph, lexicographic product, disjunction graph and total graph.
Downloads
References
F. L. Alfeche, V. Barraza and S. Canoy, Jr., Closeness centrality of vertices in graphs under some operations, European Journal of Pure and Applied Mathematics 16(3) (2023), 1406 – 1420, DOI: 10.29020/nybg.ejpam.v16i3.4848.
R. Balakrishnan and K. Ranganathan, A Textbook of Graph Theory, Springer, New York, xiii + 292 pages (2012), DOI: 10.1007/978-1-4614-4529-6.
R. G. Eballe and I. S. Cabahung, Jr., Closeness centrality of some graph families, International Journal of Contemporary Mathematical Sciences 16(4) (2021), 127 – 134, DOI: 10.12988/ijcms.2021.91609.
R. G. Eballe, C. M. R. Balingit, I. S. Cabahung, Jr., A. L. V. Flores, S. M. B. Lumpayao, B. D. Penalosa, G. A. L. Tampipi and C. A. Villarta, Closeness centrality in graph product, Advances and Applications in Discrete Mathematics 39(1) (2023), 29 – 41, DOI: 10.17654/0974165823034.
H. Fouad and N. Rego, Centrality measures in supply chain management research, IFACPapersOnLine 55(10) (2022), 2085 – 2090, DOI: 10.1016/j.ifacol.2022.10.015.
L. C. Freeman, A set of measures of centrality based on betweenness, Sociometry 40(1) (1977), 35 – 41, DOI: 10.2307/3033543.
F. Harary, Graph Theory, Addison-Wesley Publishing Company, Reading – Massachusetts, ix + 274 pages (1969), URL: https://users.metu.edu.tr/aldoks/341/Book%201%20(Harary).pdf.
S. Klee, H. Lehmann and A. Park, Prime labeling of families of trees with Gaussian integers, AKCE International Journal of Graphs and Combinatorics 13(2) (2016), 165 – 176, DOI: 10.1016/j.akcej.2016.04.001.
V. R. Kulli, On edge neighborhood graphs, Annals of Pure and Applied Mathematics 11(1) (2016), 79 – 83, URL: http://www.researchmathsci.org/apamart/APAM-V11n1-9.pdf.
A. Landherr, B. Friedl and J. Heidemann, A critical review of centrality measures in social networks, Business & Information Systems Engineering 2 (2010), 371 – 385, DOI: 10.1007/s12599-010-0127-3.
S. Meena and K. Vaithilingam, Prime labeling for some fan related graphs, International Journal of Engineering Research & Technology 1(9) (2012), Paper ID IJERTV1IS9313, URL: https://www.ijert.org/research/prime-labeling-for-some-fan-related-graphs-IJERTV1IS9313.pdf.
P. Nirmala, L. R. Sulochana and N. Rethnasamy, Centrality measures-based algorithm to visualize a maximal common induced subgraph in large communication networks, Knowledge and Information Systems 46 (2016), 213 – 239, DOI: 10.1007/s10115-015-0844-5.
N. Parisutham, How do centrality measures help to predict similarity patterns in molecular chemical structural graphs?, Artificial Intelligence Chemistry 1(2) (2023), 100007, DOI: 10.1016/j.aichem.2023.100007.
F. Rosselló and G. Valiente, Chemical graphs, chemical reaction graphs, and chemical graph transformation, Electronic Notes in Theoretical Computer Science 127(1) (2005), 157 – 166, DOI: 10.1016/j.entcs.2004.12.033.
P. L. N. Varma, R. Babu and T. N. Rao, Edge-to-vertex and edge-to-edge D-distances, Italian Journal of Pure and Applied Mathematics 44 (2020), 814 – 820, URL: https://ijpam.uniud.it/online_issue/202044/73%20ReddyBabu-Varma.pdf.
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
