Geodesic
Weak Total Resolvability In Graphs
Discussiones Mathematicae. Graph Theory, Tome 36 (2016) no. 1, pp. 185-210

Voir la notice de l'article provenant de la source Library of Science

A vertex v ∈ V (G) is said to distinguish two vertices x, y ∈ V (G) of a graph G if the distance from v to x is di erent from the distance from v to y. A set W ⊆ V (G) is a total resolving set for a graph G if for every pair of vertices x, y ∈ V (G), there exists some vertex w ∈ W − x, y which distinguishes x and y, while W is a weak total resolving set if for every x ∈ V (G)−W and y ∈ W, there exists some w ∈ W −y which distinguishes x and y. A weak total resolving set of minimum cardinality is called a weak total metric basis of G and its cardinality the weak total metric dimension of G. Our main contributions are the following ones: (a) Graphs with small and large weak total metric bases are characterised. (b) We explore the (tight) relation to independent 2-domination. (c) We introduce a new graph parameter, called weak total adjacency dimension and present results that are analogous to those presented for weak total dimension. (d) For trees, we derive a characterisation of the weak total (adjacency) metric dimension. Also, exact figures for our parameters are presented for (generalised) fans and wheels. (e) We show that for Cartesian product graphs, the weak total (adjacency) metric dimension is usually pretty small. (f) The weak total (adjacency) dimension is studied for lexicographic products of graphs.
Keywords: metric dimension, resolving set, weak total metric dimension, weak total resolving set, adjacency dimension, graph operations 
@article{DMGT_2016_36_1_a13,
     author = {Casel, Katrin and Estrada-Moreno, Alejandro and Fernau, Henning and Rodr{\'\i}guez-Vel\'azquez, Juan Alberto},
     title = {Weak {Total} {Resolvability} {In} {Graphs}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {185--210},
     publisher = {mathdoc},
     volume = {36},
     number = {1},
     year = {2016},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2016_36_1_a13/}
}
TY  - JOUR
AU  - Casel, Katrin
AU  - Estrada-Moreno, Alejandro
AU  - Fernau, Henning
AU  - Rodríguez-Velázquez, Juan Alberto
TI  - Weak Total Resolvability In Graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2016
SP  - 185
EP  - 210
VL  - 36
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2016_36_1_a13/
LA  - en
ID  - DMGT_2016_36_1_a13
ER  - 
%0 Journal Article
%A Casel, Katrin
%A Estrada-Moreno, Alejandro
%A Fernau, Henning
%A Rodríguez-Velázquez, Juan Alberto
%T Weak Total Resolvability In Graphs
%J Discussiones Mathematicae. Graph Theory
%D 2016
%P 185-210
%V 36
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2016_36_1_a13/
%G en
%F DMGT_2016_36_1_a13
Casel, Katrin; Estrada-Moreno, Alejandro; Fernau, Henning; Rodríguez-Velázquez, Juan Alberto. Weak Total Resolvability In Graphs. Discussiones Mathematicae. Graph Theory, Tome 36 (2016) no. 1, pp. 185-210. http://geodesic.mathdoc.fr/item/DMGT_2016_36_1_a13/