On connected resolvability of graphs

Australasian Journal of Combinatorics

Volumn 28, Issue , 2003, Pages 25-37

  Saenpholphat, Varaporn ^a   Zhang, Ping ^a  

^a WESTERN MICHIGAN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17844404114     PISSN: 10344942     EISSN: 22023518     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. P. Buczkowski, G. Chartrand, C. Poisson and P. Zhang, On k-dimensional graphs and their bases, Period. Math. Hungar. 46 (2003), 9-15.
2. G. Chartrand, L. Eroh, M. Johnson and O. Oellermann, Resolvability in graphs and the metric dimension of a graph, Discrete. Appl. Math. 105 (2000), 99-113.
3. G. Chartrand and L. Lesniak, Graphs & Digraphs, third edition, Chapman & Hall, New York (1996).
4. G. Chartrand, C. Poisson and P. Zhang, Resolvability and the upper dimension of graphs, Inter. J. Comput. Math. Appl. 39 (2000), 19-28.
5. M.R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York (1979).
6. F. Harary and R. A. Melter, On the metric dimension of a graph. Ars Combin. 2 (1976), 191-195.
7. M.A. Johnson, Browsable structure-activity datasets, (submitted).
8. M. Raines and P. Zhang, The Steiner distance dimension of graphs. Australas. J. Combin. 20 (1999), 133-143.
9. P. J. Slater, Leaves of trees. Congr. Numer. 14 (1975), 549-559.
10. P. J. Slater, Dominating and reference sets in graphs. J. Math. Phys. Sci. 22 (1988), 445-455.
11. V. Saenpholphat and P. Zhang, Connected resolvibility of graphs, Czech. Math. J. (to appear).