Closeness Centrality of Vertices in Graphs Under Some Operations

Authors

  • Farene Loida Alfeche Department of Mathematics and Statistics, College of Science and Mathematics, MSU-Iligan Institute of Technology, 9200 Iligan City, Philippines
  • Victor Barraza Visayas State University
  • Sergio Canoy, Jr. Center for Mathematical and Theoretical Physical Sciences-PRISM, MSU-Iligan Institute of Technology, 9200 Iligan City, Philippines

DOI:

https://doi.org/10.29020/nybg.ejpam.v16i3.4848

Keywords:

closeness centrality, shadow graph, edge corona, complementary prism, disjunction

Abstract

In this paper, we revisit the concept of (normalized) closeness centrality of a vertex in a graph and investigate it
in some graphs under some operations. Specifically, we derive formulas that compute the closeness centrality of vertices in
the shadow graph, complementary prism, edge corona, and disjunction of graphs.

Downloads

Published

2023-07-30

Issue

Vol. 16 No. 3: (July 2023)

License

Copyright (c) 2023 European Journal of Pure and Applied Mathematics

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.

European Journal of Pure and Applied Mathematics will be Copyright Holder.

How to Cite

Closeness Centrality of Vertices in Graphs Under Some Operations. (2023). European Journal of Pure and Applied Mathematics, 16(3), 1406-1420. https://doi.org/10.29020/nybg.ejpam.v16i3.4848