Computing the l,k-Clique Metric Dimension of Graphs via (Edge) Corona Products and Integer Linear Programming Model

Zeinab Shahmiri, Mostafa Tavakoli and Mohammad W. Alomari

Journal of Mathematics, 2024, vol. 2024, 1-5

Abstract: Let G be a graph with n vertices and CG=X:X is an l-clique of G. A vertex v∈VG is said to resolve a pair of cliques X,Y in G if dGv,X≠dGv,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 RGX,Y, is the collection of all vertices which resolve the pair X,Y. A subset S of VG is called an l,k-clique metric generator for G if RGX,Y∩S≥k for each pair of distinct l-cliques X and Y of G. The l,k-clique metric dimension of G, denoted by l−cdimkG, is defined as minS: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.

Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2024/3241718.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2024/3241718.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:3241718

DOI: 10.1155/2024/3241718

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().