Can I read Algorithm For Finding Domination Resolving Number of A Graph on EtoBox?

Algorithm For Finding Domination Resolving Number of A Graph by shiva is a document available to read on EtoBox.

What is Algorithm For Finding Domination Resolving Number of A Graph about?

This paper presents an algorithm for finding the domination resolving number of a graph, which is defined as the lowest cardinality of a dominant resolving set. The study emphasizes the importance of metric dimension in various applications such as network discovery and robot navigation. The paper includes new propositions and a detailed algorithm to determine the dominant basis of a graph, contributing to the growing field of graph theory.

Author

shiva

Language

EN