Let G = (V (G), E(G)) be any finite, undirected, simple graph. The maximun size of a clique containing a vertex \(\mathit{x}\) \(\in\) V (G) is called the clique centrality of \(\mathit{x}\) , denoted by \(\omega\)G (\(\mathit{x}\)) . A set D \(\subseteq\) V (G) is said to be a p...
Open access
Research Article10.9734/arjom/2023/v19i10722
Let G = (V (G),E (G)) be any finite, undirected, simple graph. The clique centrality of a vertex \(\mathit{x}\) \(\in\) V (G), denoted by \(\omega\)G (\(\mathit{x}\)), is the maximum size of a clique in G containing \(\mathit{x}\). A set D \(\subseteq\) V (G) is introduced in thi...
Open access
Research Article10.9734/arjom/2023/v19i9717
Let G = (V (G), E(G)) be any finite, undirected, simple graph. A set D \(\subseteq\) V (G) is introduced in this paper as a clique-safe dominating set of G if D is a dominating set of G and for every clique D\(\prime\)m of size m in the subgraph induced by V (G) \D, there exists...
Open access
Research Article10.9734/arjom/2023/v19i4651