Previous |  Up |  Next

Article

Keywords:
distance; resolving decomposition; connected resolving decomposition
Summary:

References:
[1] J. Bosák: Decompositions of Graphs. Kluwer Academic, Boston, 1990. MR 1071373
[2] G. Chartrand, D. Erwin, M. Raines, P. Zhang: The decomposition dimension of graphs. Graphs Combin. 17 (2001), 599–605. MR 1876570
[3] G. Chartrand, L. Lesniak: Graphs $\&$ Digraphs, third edition. Chapman $\&$ Hall, New York, 1996. MR 1408678
[4] H. Enomoto, T. Nakamigawa: On the decomposition dimension of trees. Preprint. MR 1907757
[5] A. Küngen, D. B. West: Decomposition dimension of graphs and union-free family of sets. Preprint.
[6] M. A. Johnson: Structure-activity maps for visualizing the graph variables arising in drug design. J. Biopharm. Statist. 3 (1993), 203–236. Zbl 0800.92106
[7] M. A. Johnson: Browsable structure-activity datasets. Preprint.
[8] F. Harary, R. A. Melter: On the metric dimension of a graph. Ars Combin. 2 (1976), 191–195. MR 0457289
[9] P. J. Slater: Leaves of trees. Congress. Numer. 14 (1975), 549–559. MR 0422062 | Zbl 0316.05102
[10] P. J. Slater: Dominating and reference sets in graphs. J. Math. Phys. Sci. 22 (1988), 445–455. MR 0966610
Partner of
EuDML logo