TY  - GEN 
AU  - Kuziak, Dorota
AU  - González Yero, Ismael
A4  - Estadística e Investigación Operativa
A4  - Matemáticas
PY  - 2020
SN  - 2391-5455
UR  - http://hdl.handle.net/10498/23257
AB  - A set W of vertices of a connected graph G strongly resolves two different vertices x, y is not an element of W if either d(G) (x, W) = d(G) (x, y) + d(G) (y, W) or d(G) (y, W) = d(G )(y, x) + d(G) (x, W), where d(G) (x, W) = min{d(x,w): w is an...
LA  - eng
PB  - DE GRUYTER
KW  - strong resolving set
KW  - strong metric dimension
KW  - strong resolving partition
KW  - strong partition dimension
KW  - strong resolving graph
TI  - Further new results on strong resolving partitions for graphs
DO  - 10.1515/math-2020-0142
ER  -