Publication search
with resolving set as keyword

New Computation of Resolving Connected Dominating Sets in Weighted Networks

Published in Entropy

In this paper we focus on the issue related to finding the resolving connected dominating sets (RCDSs) of a graph, denoted by G . The connected dominating set (CDS) is a connected subset of vertices of G selected to guarantee that all vertices in the graph are connected to vertices in the CDS. The connected dominating set with minimum cardinality, ...

On the Metric Dimension of Arithmetic Graph of a Composite Number

This paper is devoted to the study of the arithmetic graph of a composite number m, denoted by A m . It has been observed that there exist different composite numbers for which the arithmetic graphs are isomorphic. It is proved that the maximum distance between any two vertices of A m is two or three. Conditions under which the vertices have the sa...