Affiliation:
1. Departamento de Estadística e Investigación Operativa , Escuela Politécnica Superior de Algeciras , Universidad de Cádiz , Av. Ramón Puyol s/n , 11202 Algeciras , Spain
2. Departamento de Matemáticas , Escuela Politécnica Superior de Algeciras , Universidad de Cádiz , Av. Ramón Puyol s/n , 11202 Algeciras , Spain
Abstract
Abstract
A set W of vertices of a connected graph G strongly resolves two different vertices x, y ∉ 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 ∈ W} and d(x,w) represents the length of a shortest x − w path. An ordered vertex partition Π = {U
1, U
2,…,U
k
} of a graph G is a strong resolving partition for G, if every two different vertices of G belonging to the same set of the partition are strongly resolved by some other set of Π. The minimum cardinality of any strong resolving partition for G is the strong partition dimension of G. In this article, we obtain several bounds and closed formulae for the strong partition dimension of some families of graphs and give some realization results relating the strong partition dimension, the strong metric dimension and the order of graphs.
Reference25 articles.
1. P. J. Slater, Leaves of trees, Congr. Numer. 14 (1975), 549–559.
2. F. Harary and R. A. Melter, On the metric dimension of a graph, Ars Combin. 2 (1976), 191–195.
3. A. Sebö and E. Tannier, On metric generators of graphs, Math. Oper. Res. 29 (2004), 383–393, 10.1287/moor.1030.0070.
4. M. A. Johnson, Structure–activity maps for visualizing the graph variables arising in drug design, J. Biopharm. Statist. 3 (1993), 203–236, 10.1080/10543409308835060.
5. M. A. Johnson, Browsable structure–activity datasets, in R. Carbó-Dorca and P. Mezey, (eds), Advances in Molecular Similarity, JAI Press, Connecticut, 1998, pp. 153–170.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献