Full entry |
PDF
(0.3 MB)
Feedback

resolving dominating set; resolving domination number

References:

[1] G. Chartrand, L. Eroh, M. Johnson, O. R. Oellermann: **Resolvability in graphs and the metric dimension of a graph**. Discrete Appl. Math. 105 (2000), 99–113. DOI 10.1016/S0166-218X(00)00198-0 | MR 1780464

[2] G. Chartrand, L. Lesniak: **Graphs & Digraphs, third edition**. Chapman & Hall, New York, 1996. MR 1408678

[3] G. Chartrand, C. Poisson, P. Zhang: **Resolvability and the upper dimension of graphs**. International J. Comput. Math. Appl. 39 (2000), 19–28. MR 1763834

[4] T. W. Haynes, S. T. Hedetniemi, P. J. Slater: **Fundamentals of Domination in Graphs**. Marcel Dekker, New York, 1998. MR 1605684

[5] F. Harary, R. A. Melter: **On the metric dimension of a graph**. Ars Combin. 2 (1976), 191–195. MR 0457289

[7] P. J. Slater: **Dominating and reference sets in graphs**. J. Math. Phys. Sci. 22 (1988), 445–455. MR 0966610