The threshold strong dimension of a graph
From MaRDI portal
Publication:2032722
DOI10.1016/j.disc.2021.112402zbMath1466.05106arXiv2008.04282OpenAlexW3156791226MaRDI QIDQ2032722
Nadia Benakli, Shonda Dueck, Linda Eroh, Beth Novick, Novi H. Bong, Ortrud R. Oellermann
Publication date: 14 June 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.04282
bounds for the threshold strong dimensionembeddings in strong products of graphsgraphs with vertex covering number 2 realizable by strong resolving graphsstrong dimension of graphsthreshold strong dimensionthreshold strong dimension and trees
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The strong metric dimension of graphs and digraphs
- Resolvability in graphs and the metric dimension of a graph
- Strong resolving graphs: the realization and the characterization problems
- The threshold dimension of a graph
- A short note on: there is no graph \(G\) with \(G_{\mathrm{SR}} \cong\)\(K_{r, s},\ r, s \geq 2\)
- On Metric Generators of Graphs
This page was built for publication: The threshold strong dimension of a graph