Studies of Chordal Ring Networks via Double Metric Dimensions

Abstract

Locating the sources of information spreading in networks including tracking down the origins of epidemics, rumors in social networks, and online computer viruses, has a wide range of applications. In many situations, identifying where an epidemic started, or which node in a network served as the source, is crucial. But it can be difficult to determine the root of an outbreak, especially when data are scarce and noisy. The goal is to find the source of the infection by analysing data provided by only a limited number of observers, such as nodes that can indicate when and where they are infected. Our goal is to investigate where the least number of observers should be placed, which is similar to how to figure out the minimal doubly resolving sets in the network. In this paper, we calculate the double metric dimension of chordal ring networks C R n 1,3,5 by describing their minimal doubly resolving sets.

Some stable and closed-shell structures of anticancer drugs by graph theoretical parameters

“…Nullity is expressed in terms of maximum degree of a vertex [22] , [23] . Authors of [24] , [25] , computed the double metric resolvability of convex polytopes, authors of [26] , computed the edge version of resolvability and double resolvability of some generalized graphs.…”

A Study on Minimal Doubly Resolving Sets of Certain Families of Networks

“…Another study by Pan et al [32], showed the DMD was always the same in the case of some convex polytopes. Also, the MDRSs for the chordal ring networks is discussed in [33]. The problems of MD and MDRS for cocktail party networks and jellyfish networks have been investigated in [34].…”