The partition dimension of a graph

Aequationes Mathematicae

Volumn 59, Issue 1-2, 2000, Pages 45-54

  Chartrand, Gary ^a   Salehi, Ebrahim ^b   Zhang, Ping ^a  

^a WESTERN MICHIGAN UNIVERSITY   (United States)

^b UNIVERSITY OF NEVADA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17844400423     PISSN: 00019054     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00000127     Document Type: Article

References (6)

1. G. CHARTRAND, L. EROH, M. JOHNSON AND O. R. OELLERMANN, Resolvability in graphs and the metric dimension of a graph, preprint.
2. G. CHARTRAND, M. RAINES AND P. ZHANG, The directed distance dimension of oriented graphs, Math. Bohem. (to appear).
3. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
4. F. HARARY AND R. A. MELTER, On the metric dimension of a graph, Ars Combin. 2 (1976), 191-195.
5. P. J. SLATER, Leaves of trees, in: Proc. 6th Southeast Conf. Comb., Graph Theory, Comput.; Boca Raton, 14 (1975), 549-559.
6. P. J. SLATER, Dominating and reference sets in graphs, J. Math. Phys. Sci. 22 (1988), 445-455.