Skip to content
Research Article Open access CC BY 4.0

Clique Centrality and Global Clique Centrality of Graphs

Gerry J. Madriaga, Rolito G. Eballe

Asian Research Journal of Mathematics · pp. 9–16 · Published 3 Feb 2023

10.9734/arjom/2023/v19i2640

Abstract

We formally introduce in this paper two parameters in graph theory, namely, clique centrality and global clique centrality. Let G be a finite, simple and undirected graph of order n. A clique in G is a nonempty subset W \(\subseteq\) V (G) such that the subgraph \(\langle\)W\(\rangle\)G induced by W is complete. The maximum size of any clique containing vertex u \(\in\) V (G) is called the clique centrality of u in G. Normalizing the sum of the clique centralities of all the vertices of G will lead us to the global clique centrality of G, whose value ranges from \(\frac{1}{m}\) to 1. In this paper, we study some general properties of the global clique centrality and then evaluate it for some parameterized families of graphs.

Clique centrality global clique centrality social network

Cited by 2

Introducing the Clique-Safe Domination in Graphs

John Mark R. Liwat, Rolito G. Eballe · Asian Research Journal of Mathematics · 2023

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

2

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.