Saved in:
Bibliographic Details
Main Authors: Zafari, Ali, Alikhani, Saeid
Format: Preprint
Published: 2022
Subjects:
Online Access:https://arxiv.org/abs/2201.07799
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914540832161792
author Zafari, Ali
Alikhani, Saeid
author_facet Zafari, Ali
Alikhani, Saeid
contents The task of identifying resolving sets has been extensively studied due to its wide relevance in fields such as chemistry, robot navigation, combinatorial optimization, pattern recognition, and image processing. These applications have helped motivate and establish the theoretical foundations of the subject. Notably, problems of this type are generally known to be NP-hard. This study introduces an alternative structural representation for the crystal cubic carbon \( CCC(n) \). Building on this model, we determine the minimum sizes of both a doubly resolving set and a strong resolving set for $CCC(n)$.
format Preprint
id arxiv_https___arxiv_org_abs_2201_07799
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle A Minimum Doubly Resolving Set and Strong Resolving Set for the Crystal Cubic Carbon
Zafari, Ali
Alikhani, Saeid
General Mathematics
05C12, 05C90
The task of identifying resolving sets has been extensively studied due to its wide relevance in fields such as chemistry, robot navigation, combinatorial optimization, pattern recognition, and image processing. These applications have helped motivate and establish the theoretical foundations of the subject. Notably, problems of this type are generally known to be NP-hard. This study introduces an alternative structural representation for the crystal cubic carbon \( CCC(n) \). Building on this model, we determine the minimum sizes of both a doubly resolving set and a strong resolving set for $CCC(n)$.
title A Minimum Doubly Resolving Set and Strong Resolving Set for the Crystal Cubic Carbon
topic General Mathematics
05C12, 05C90
url https://arxiv.org/abs/2201.07799