Let G be a graph with n vertices and CG � {X: X is an l-clique of G}. A vertex v ∈ V(G) is said to resolve a pair of cliques { } X, Y in G if dG(v, X)≠dG(v, Y) where dG is the distance function of G. For a pair of cliques { } X, Y , the resolving neighbourhood of X and Y, denoted by RG{ } X, Y , is the collection of all vertices which resolve the pair { } X, Y . A subset S of V(G) is called an (l, k)-clique metric generator for G if |RG{ } X, Y ∩S|≥k for each pair of distinct l-cliques X and Y of G. ,e (l, k)-clique metric dimension of G, denoted by l − cdimk(G), is de3ned as min {|S|: S is an (l, k)-clique metric generator of G}. In this paper, the (l, k)-clique metric dimension of corona and edge corona of two graphs are computed. In addition, an integer linear programming model is presented for the (l, k)-clique metric basis for a given graph G and its l-cliques.

Keywords