Let  be a finite, nondirected, simple graph of order n. A nonempty subset W of  such that the subgraph  induced by W is complete is referred to as a clique in G. It is considered maximal if it is not properly contained within a larger clique. The size of the largest clique containing  is called the clique centrality of u and is denoted by  The ratio of the sum of the clique centralities of G at the vertex level to the square of the order of G is called the global clique centrality of G, denoted by  In this paper, we study further the concept of clique centrality and global clique centrality of a graph and investigate it for graphs resulting from some binary operations. In particular, the clique centralities of the vertices in the join and vertex corona of graphs are examined and the corresponding global clique centralities of these graphs are obtained.

clique, centrality, global clique centrality, social network.

Received: February 3, 2023; Revised: March 21, 2023; Accepted: March 30, 2023; Published: April 18, 2023

How to cite this article: Gerry J. Madriaga and Rolito G. Eballe, Clique centrality and global clique centrality in the join and corona of graphs, Advances and Applications in Discrete Mathematics 38(2) (2023), 191-202. http://dx.doi.org/10.17654/0974165823028

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References:

[1] G. J. Madriaga and R. G. Eballe, Clique centrality and global clique centrality of graphs, Asian Research Journal of Mathematics 19(2) (2023), 9-16.
[2] D. Zuckerman, Linear degree extractors and the inapproximability of max clique and chromatic number, Proceedings of the Thirty-eighth Annual ACM Symposium on Theory of Computing, 2006, pp. 681-690.
[3] R. J. Damalerio and R. G. Eballe, Triangular index of some graph products, Appl. Math. Sci. 15(12) (2021), 587-594.
[4] R. G. Eballe, R. Aldema, E. M. Paluga, R. F. Rulete and F. P. Jamil, Global defensive alliances in the join, corona and composition of graphs, Ars Combin. 107 (2012), 225-245.
[5] R. J. Damalerio, R. G. Eballe, C. M. Balingit, I. S. Cabahug, Jr. and A. L. Flores, Global clustering coefficient of the join and corona of graphs, Asian Research Journal of Mathematics 18(12) (2022), 128-140.
[6] R. Eballe and I. Cabahug, Closeness centrality of some graph families, International Journal of Contemporary Mathematical Sciences 16(4) (2021), 127 134.
[7] M. P. Militante and R. G. Eballe, Exploring the vertex and edge corona of graphs for their weakly connected 2-domination, International Journal of Contemporary Mathematical Sciences 16(4) (2021), 161-172.
[8] A. T. Miranda and R. G. Eballe, Domination defect for the join and corona of graphs, Appl. Math. Sci. 15(12) (2021), 615-623.
[9] B. L. Susada and R. G. Eballe, Independent semitotal domination in the join of graphs, Asian Research Journal of Mathematics 19(3) (2023), 25-31.
[10] R. J. Damalerio and R. G. Eballe, Global clustering coefficient of the products of complete graphs, Asian Research Journal of Mathematics 18(6) (2022), 62-69.
[11] P. Zhang and G. Chartrand, Introduction to Graph Theory, Tata McGraw-Hill, 2006.
[12] R. Frucht and F. Harary, On the corona of two graphs, Aequationes Math. 4 (1970), 322 325. https://doi.org/10.1007/bf01844162.