Closeness Centrality Weight of Graphs Under Some Graph Operations
Keywords:
Centrality measures, closeness centrality, 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
References
R. Balakrishnan and K. Ranganathan, A Textbook of Graph Theory, Springer, New York,
, doi:10.1007/978-1-4614-4529-6.
Farene Loida Alfeche, Victor Barraza and Sergio Canoy, Jr., Closeness centrality of Vertices
in Graphs Under Some Operations, European Journal of Pure and Applied Mathematics,
(3) (2023), 1406 - 1420, doi:10.29020/nybg.ejpam.v16i3.4848.
F. Harary, Graph Theory, Addison Wesley Publishing Company, Reading Massachusetts
(1969), https://users.metu.edu.tr/aldoks/341/Book%201%20(Harary).pdf.
V. R. Kulli, On Edge Neighborhood Graphs, Annals of Pure and Applied Mathematics,
(2016), 79 - 83, https://www.researchgate.net/publication/290271418.pdf.
S. Meena and K. Vaithilingam, Prime Labeling For Some Fan Related Graphs, Interna-
tional Journal of Engineering Research and Technology, 1(9), (2012), https://www.ijert.
org.pdf.
Rolito G. Eballe, Cherry Mae R. Balingit, Isagani S. Cabahung, Jr., Ann Leslie V. Flo-
res, Shiena Mae B. Lumpayao, Braullo D. Penalosa, Glee Ann L. Tampipi and Cerina
A. Villarta, Closeness centrality in graph product, Advances and Applications in Discrete
Mathematics, 39(1) (2023), 29 - 41, doi:10.17654/0974165823034
Rolito G. Eballe and Isagani Jr. Serino Cabahung., Closeness centrality of some graph
families, I nternational Journal of Contemporary Mathematical Sciences, 16(4) (2021), 127
- 134, doi:10.12988/ijcms.2021.91609.
Steven Klee, Hunter Lehmann and Andrew Park, Prime Labeling of Families of Trees with
Gaussian Integers, AKCE International Journal of Graphs and Combinatorics, 13 (2016),
- 176, doi:10.1016/j.akcej.2016.04.001.
P. L. N Varma, Reddy Babu and T. Nageswara Rao, Edge-to-vertex and edge-to-edge
D-distances, I talian Journal of Pure and Applied Mathematics, (2020), 814 { 820, https:
//ijpam.uniud.it.pdf.
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.
