Work

On Some Special Trees With Respect to the Connected Metric Dimension of Graphs

Year: 2024

Type: article

Abstract: The idea of a minimal resolving set has been used in a variety of contexts, including coin weighing, mastermind games, robot navigation, networking, and optimization. An NP-complete problem is determining the connected metric dimension of a given graph. In this study, we determine the exact value of the connected metric dimension for a number of trees, including Y-tree network, subdivision of Y-tree network, F-tree network, a subdivision of the F-tree network and the coconut network . Finally, we derive the explicit formulas for the subdivision of the -fire cracker and the subdivision of the coconut tree .

Source: Advances and Applications in Discrete Mathematics

DOI: 10.17654/0974165824044

Authors: Yasser M. Hausawi, Mohammed El-Meligy, Zaid Alzaid, Olayan Alharbi, Badr Almutairi, Basma Mohamed

Language: English

Topic: Graph Labeling and Dimension Problems

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funder: Majmaah University

Awards: G1398355441, G3624072733

OpenAlex ID: W4404047868

FWCI:

Cites:

Cited by:

Related to: 10