Monitoring the edges of product networks using distances

arXiv2211.10743MaRDI QIDQ6507101FDOQ6507101

Authors: Wen Li, Ralf Klasing, Yaping Mao, Bo Ning 

Abstract: Foucaud {it et al.} recently introduced and initiated the study of a new graph-theoretic concept in the area of network monitoring. Let $G$ be a graph with vertex set $V(G)$, $M$ a subset of $V(G)$, and $e$ be an edge in $E(G)$, and let $P(M,e)$ be the set of pairs $(x,y)$ such that $d_G(x,y)eq{d}_{G-e}(x,y)$ where $xinM$ and $yinV(G)$. $M$ is called a emph{distance-edge-monitoring set} if every edge $e$ of $G$ is monitored by some vertex of $M$, that is, the set $P(M,e)$ is nonempty. The {em distance-edge-monitoring number} of $G$, denoted by $operatornamedem(G)$, is defined as the smallest size of distance-edge-monitoring sets of $G$. For two graphs $G,H$ of order $m,n$, respectively, in this paper we prove that $maxmoperatornamedem(H),noperatornamedem(G)leqoperatornamedem(G,Box,H)leqmoperatornamedem(H)+noperatornamedem(G)-operatornamedem(G)operatornamedem(H)$, where $Box$ is the Cartesian product operation. Moreover, we characterize the graphs attaining the upper and lower bounds and show their applications on some known networks. We also obtain the distance-edge-monitoring numbers of join, corona, cluster, and some specific networks.

This page was built for publication: Monitoring the edges of product networks using distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6507101)