scientific article; zbMATH DE number 2024674
If \(S\) is a vertex set of a connected graph \(G\), then the distance of a vertex \(v\) with respect to \(S\) is defined by \(d_S(v)=\sum_{x\in S}d(v,x)\). If \(d_S(u)\neq d_S(v)\) for each pair \(u,v\) of distinct vertices of \(G\), then \(S\) is called a distance-locating set of \(G\). The minimum cardinality of a distance-locating set of \(G\) is its distance-location number \(\text{loc}_d(G)\). If \(d_S(u)\neq d_S(v)\) for each pair \(u,v\) of distinct vertices of \(G-S\), then \(S\) is called an external distance-locating set of \(G\). The minimum cardinality of an external distance-locating set of \(G\) is its external distance-location number. The authors show that there are infinite classes of connected graphs \(G\) for which \(\text{loc}_d(G)\) exists as well as infinite classes of connected graphs \(G\) for which \(\text{loc}_d(G)\) does not exist. Moreover, they prove that no distance-locating set has cardinality 2 or 3. Lower bounds for the distance-location and external distance-location numbers are also presented.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4443243)
