Connected resolvability of graphs

Czechoslovak Mathematical Journal

Volumn 53, Issue 4, 2003, Pages 827-840

  Saenpholphat, Varaporn ^a   Zhang, Ping ^a  

^a WESTERN MICHIGAN UNIVERSITY   (United States)

Author keywords

Basis; Connected resolving number; Connected resolving set; Dimension; Resolving set

Indexed keywords

EID: 1342347566     PISSN: 00114642     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:CMAJ.0000024524.43125.cd     Document Type: Article

References (10)

1. P. Buczkowski, G. Chartrand, C. Poisson and P. Zhang: On k-dimensional graphs and their bases. Period. Math. Hungar. 46 (2003), 25-36.
2. G. Chartrand, L. Eroh, M. Johnson and O. Oellerrnann: 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. G. Chartrand, M. Raines and P. Zhang: The directed distance dimension of oriented graphs. Math. Bohem. 125 (2000), 155-168.
6. M. R. Garey and D. S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.
7. F. Harary and R. A. Melter. On the metric dimension of a graph. Ars Combin. 2 (1976), 191-195.
8. M. A. Johnson: Browsable structure-activity datasets. Submitted.
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.