Multiplicative distance-location number of graphs
For a set \(S\) of vertices in a connected graph \(G\), the multiplicative distance of a vertex \(v\) with respect to \(S\) is defined by \(\displaystyle{d^\ast_{S}(v) = \prod_{x\in S,x\neq v} d(v,x)}\). If \(d_S^\ast (u) \neq d_S^\ast (v)\) for each pair \(u\), \(v\) of distinct vertices of \(G\), then \(S\) is called a multiplicative distance-locating set of \(G\). The minimum cardinality of a multiplicative distance-locating set of \(G\) is called its multiplicative distance-location number \(\operatorname{loc}^\ast_{d}(G)\). If \(d_S^\ast (u) \neq d_S^\ast (v)\) for each pair \(u\), \(v\) of distinct vertices of \(G-S\), then \(S\) is called an external multiplicative distance-locating set of \(G\). The minimum cardinality of an external multiplicative distance-locating set of \(G\) is called its external multiplicative location number \(\operatorname{loc}^\ast_{d}(G)\). The authors prove the existence or nonexistence of multiplicative distance-locating sets in some well-known classes of connected graphs. Also, in this article, the authors introduce a family of connected graphs such that \(\operatorname{loc}^\ast_{d}(G)\) exists. Moreover, they also prove that there are infinite classes of connected graphs \(G\) for which \(\operatorname{loc}^\ast_{d}(G)\) exists as well as infinite classes of connected graphs \(G\) for which \(\operatorname{loc}^\ast_{d}(G)\) does not exist. A lower bound for the multiplicative distance-location number of a connected graph is established in terms of its order and diameter.
This page was built for publication: Multiplicative distance-location number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6625066)
