Pointwise Clique-Safe Domination in Graphs
John Mark R. Liwat, Rolito G. Eballe · Asian Research Journal of Mathematics · 2023
Let G = (V (G), E(G)) be any finite, undirected, simple graph.The clique centrality of a vertexThe smallest cardinality of such a pointwise clique-safe dominating set of G is called the pointwise clique-safe domination number of G, denoted by γpcs(G).This study aims to generate some observable properties of the parameter and to evaluate the minimum pointwise clique-safe dominating sets of some special families of graphs such as the complete graph Kn, fan graph Fn, wheel graph Wn and complete bipartite Km,n as well as graphs obtained under the mycielski operation.