Distance-location numbers of graphs

Utilitas Mathematica

Volumn 63, Issue , 2003, Pages 65-79

  Chartrand, Gary ^a   Erwin, David ^b   Slater, Peter J ^c   Zhang, Ping ^a  

^a WESTERN MICHIGAN UNIVERSITY   (United States)

^b TRINITY COLLEGE   (United States)

^c UNIVERSITY OF ALABAMA IN HUNTSVILLE   (United States)

Author keywords

Distance; Distance locating set; Distance location number

Indexed keywords

EID: 0038010939     PISSN: 03153681     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (4)

1. G. Chartrand, L. Eroh, M. Johnson, and O. R. Oellermann, Resolvability in graphs and the metric dimension of a graph. Discrete Appl. Math. 105 (2000) 99-113.
2. F. Harary and R. A. Melter, On the metric dimension of a graph. Ars Combin. 2 (1976) 191-195.
3. P.J. Slater, Leaves of trees. Congress. Numer. 14 (1975) 549-559.
4. P.J. Slater, Dominating and reference sets in graphs. J. Math. Phys. Sci. 22 (1988) 445-455.