Weak total resolving sets in graphs

zbMATH Open1427.05069arXiv1408.0649MaRDI QIDQ5206574FDOQ5206574

Muhammad Salman, M. Imran, Imran Javaid, Farheen Iftikhar, M. Murtaza

Publication date: 18 December 2019

Abstract: A set $W$ of vertices of $G$ is said to be a weak total resolving set for $G$ if $W$ is a resolving set for $G$ as well as for each $winW$, there is at least one element in $W-w$ that resolves $w$ and $v$ for every $vinV(G)-W$. Weak total metric dimension of $G$ is the smallest order of a weak total resolving set for $G$. This paper includes the investigation of weak total metric dimension of trees. Also, weak total resolving number of a graph as well as randomly weak total $k$-dimensional graphs are defined and studied in this paper. Moreover, some characterizations and realizations regarding weak total resolving number and weak total metric dimension are given.

Full work available at URL: https://arxiv.org/abs/1408.0649

zbMATH Keywords

twinsmetric dimensionweak total metric dimensionrandomly weak total \(k\)-dimensional graphweak total resolving number

Mathematics Subject Classification ID

Distance in graphs (05C12)

Cited In (3)

• Minimum weight resolving sets of grid graphs
• On weak resolutions
• On the \(k\)-partition dimension of graphs

This page was built for publication: Weak total resolving sets in graphs

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