COMPUTING THE INDEPENDENT DOMINATION METRIC DIMENSION PROBLEM OF SPECIFIC GRAPHS

COMPUTING THE INDEPENDENT DOMINATION METRIC DIMENSION PROBLEM OF SPECIFIC GRAPHS

We consider, in this paper, the NP-hard problem of finding the minimum independent domination metric dimension of graphs. A vertex set 𝐵 of a connected graph 𝐺(𝑉, 𝐸) resolves 𝐺 if every vertex of 𝐺 is uniquely identified by its vector of distances to the vertices in 𝐵. A resolving set 𝐵 of 𝐺 is ind...

Full description

Saved in:
Bibliographic Details
Main Authors: Basma Mohamed, Iqbal M. Batiha, Mohammad Odeh, Mohammed El-Meligy
Format: Article
Language:English
Published: Institute of Mechanics of Continua and Mathematical Sciences 2024-12-01
Series:Journal of Mechanics of Continua and Mathematical Sciences
Subjects:
dominant metric dimension
domination number
independent number
metric dimension
resolving dominating set.
Online Access:https://jmcms.s3.amazonaws.com/wp-content/uploads/2024/12/13065138/jmcms-2412013-Computing-Independent-Dominating-BM-JA.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://jmcms.s3.amazonaws.com/wp-content/uploads/2024/12/13065138/jmcms-2412013-Computing-Independent-Dominating-BM-JA.pdf

Similar Items