Connected resolving sets in graphs

Ars Combinatoria

Volumn 68, Issue 1, 2003, Pages 3-16

  Saenpholphat, Varaporn ^a   Zhang, Ping ^a  

^a WESTERN MICHIGAN UNIVERSITY   (United States)

Author keywords

Connected resolving number; Connected resolving set; Distance; Upper connected resolving number

Indexed keywords

EID: 0041573254     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (7)

1. G. Chartrand and L. Lesniak, Graphs & Digraphs, third edition. Chapman & Hall, New York (1996).
2. G. Chartrand, C. Poisson, and P. Zhang, Resolvability and the upper dimension of graphs. Inter. J. Comput. Math. Appl. 39 (2000) 19-28.
3. F. Harary and R. A. Melter, On the metric dimension of a graph. Ars Combin. 2 (1976) 191-195.
4. M. A. Johnson, Browsable structure-activity datasets. Submitted.
5. V. Saenpholphat and P. Zhang, Connected resolvibility of graphs. Czech. Math. J. To appear.
6. P.J. Slater, Leaves of trees. Congr. Numer. 14 (1975) 549-559.
7. P.J. Slater, Dominating and reference sets in graphs. J. Math. Phys. Sci. 22 (1988) 445-455.