Closeness Centrality of Vertices in Graphs Under Some Operations
DOI:
https://doi.org/10.29020/nybg.ejpam.v16i3.4848Keywords:
closeness centrality, shadow graph, edge corona, complementary prism, disjunctionAbstract
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
Issue
Section
License
Copyright (c) 2023 European Journal of Pure and Applied Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.