Work

Computing the Independent Domination Metric Dimension Problem of Specific Graphs

Year: 2024

Type: article

Abstract: 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 independent if no two vertices in are adjacent. A resolving set is dominating if every vertex of that does not belong to is a neighbor to some vertices in . The cardinality of the smallest resolving set of , the cardinality of the minimal independent resolving set, and the cardinality of the minimal independent domination resolving set are the metric dimension of , independent metric dimension of , and the independent domination metric dimension of , respectively.

Source: JOURNAL OF MECHANICS OF CONTINUA AND MATHEMATICAL SCIENCES

DOI: 10.26782/jmcms.2024.12.00015

Authors: Basma Mohamed, Iqbal M. Batiha, Mohammad Odeh, Mohammed El-Meligy

Language: English

Topic: Graph Labeling and Dimension Problems

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W4405554743

FWCI: 0.401

Cites:

Cited by: 2

Related to: 10