ALGORITHM FOR FINDING DOMINATION RESOLVING NUMBER OF A GRAPH
A minimum resolving set is a resolving set with the lowest cardinality and its cardinality is a dimension of connected graph , represented by . A dominating set is a set of vertices such that each of is either in or has at least one neighbor in . The dominance number of is the lowest cardinali...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mechanics of Continua and Mathematical Sciences
2024-09-01
|
| Series: | Journal of Mechanics of Continua and Mathematical Sciences |
| Subjects: | |
| Online Access: | https://jmcms.s3.amazonaws.com/wp-content/uploads/2024/09/12090843/jmcms-2409009-Algorithm-for-finding-Domination-IB-BM.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850262284903907328 |
|---|---|
| author | Iqbal M. Batiha Nidal Anakira Basma Mohamed |
| author_facet | Iqbal M. Batiha Nidal Anakira Basma Mohamed |
| author_sort | Iqbal M. Batiha |
| collection | DOAJ |
| description | A minimum resolving set is a resolving set with the lowest cardinality and its cardinality is a dimension of connected graph , represented by . A dominating set is a set of vertices such that each of is either in or has at least one neighbor in . The dominance number of is the lowest cardinality of such a set. The lowest cardinality of the dominant resolving set is called a dominant metric dimension of , represented by . This paper presents an algorithm for finding the domination resolving number of a graph. |
| format | Article |
| id | doaj-art-eb4b4b9fe0ea42788afa8d360855d245 |
| institution | OA Journals |
| issn | 0973-8975 2454-7190 |
| language | English |
| publishDate | 2024-09-01 |
| publisher | Institute of Mechanics of Continua and Mathematical Sciences |
| record_format | Article |
| series | Journal of Mechanics of Continua and Mathematical Sciences |
| spelling | doaj-art-eb4b4b9fe0ea42788afa8d360855d2452025-08-20T01:55:12ZengInstitute of Mechanics of Continua and Mathematical SciencesJournal of Mechanics of Continua and Mathematical Sciences0973-89752454-71902024-09-011991823https://doi.org/10.26782/jmcms.2024.09.00003ALGORITHM FOR FINDING DOMINATION RESOLVING NUMBER OF A GRAPHIqbal M. Batiha0Nidal Anakira1Basma Mohamed2Department of Mathematics, Al Zaytoonah University, Jordan.Sohar University, Oman.Giza Higher Institute for Managerial Sciences, Tomah, Egypt.A minimum resolving set is a resolving set with the lowest cardinality and its cardinality is a dimension of connected graph , represented by . A dominating set is a set of vertices such that each of is either in or has at least one neighbor in . The dominance number of is the lowest cardinality of such a set. The lowest cardinality of the dominant resolving set is called a dominant metric dimension of , represented by . This paper presents an algorithm for finding the domination resolving number of a graph.https://jmcms.s3.amazonaws.com/wp-content/uploads/2024/09/12090843/jmcms-2409009-Algorithm-for-finding-Domination-IB-BM.pdfdomination numbermetric dimensionresolving dominating set |
| spellingShingle | Iqbal M. Batiha Nidal Anakira Basma Mohamed ALGORITHM FOR FINDING DOMINATION RESOLVING NUMBER OF A GRAPH Journal of Mechanics of Continua and Mathematical Sciences domination number metric dimension resolving dominating set |
| title | ALGORITHM FOR FINDING DOMINATION RESOLVING NUMBER OF A GRAPH |
| title_full | ALGORITHM FOR FINDING DOMINATION RESOLVING NUMBER OF A GRAPH |
| title_fullStr | ALGORITHM FOR FINDING DOMINATION RESOLVING NUMBER OF A GRAPH |
| title_full_unstemmed | ALGORITHM FOR FINDING DOMINATION RESOLVING NUMBER OF A GRAPH |
| title_short | ALGORITHM FOR FINDING DOMINATION RESOLVING NUMBER OF A GRAPH |
| title_sort | algorithm for finding domination resolving number of a graph |
| topic | domination number metric dimension resolving dominating set |
| url | https://jmcms.s3.amazonaws.com/wp-content/uploads/2024/09/12090843/jmcms-2409009-Algorithm-for-finding-Domination-IB-BM.pdf |
| work_keys_str_mv | AT iqbalmbatiha algorithmforfindingdominationresolvingnumberofagraph AT nidalanakira algorithmforfindingdominationresolvingnumberofagraph AT basmamohamed algorithmforfindingdominationresolvingnumberofagraph |