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!
|