Resolvability in graphs and the metric dimension of a graph

Discrete Applied Mathematics

Volumn 105, Issue 1-3, 2000, Pages 99-113

  Chartrand, Gary ^a   Eroh, Linda ^a   Johnson, Mark A ^b   Oellermann, Ortrud R ^c  

^a WESTERN MICHIGAN UNIVERSITY   (United States)

^b PFIZER INC   (United States)

^c UNIVERSITY OF WINNIPEG   (Canada)

Author keywords

Basis; Distance; Metric dimension

Indexed keywords

EID: 0037756351     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00198-0     Document Type: Article

References (5)

1. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, New York.
2. Harary F., Melter R.A. On the metric dimension of a graph. Ars Combin. 2:1976;191-195.
3. C. Poisson, P. Zhang, The dimension of unicyclic graphs, J. Combin. Math. Combin. Comput., accepted.
4. Slater P.J. Leaves of trees. Congr. Numer. 14:1975;549-559.
5. Slater P.J. Dominating and reference sets in a graph. J. Math. Phys. Sci. 22:1988;445-455.