Resolving acyclic partitions of graphs

Ars Combinatoria

Volumn 70, Issue , 2004, Pages 61-74

  Saenpholphat, Varaporn ^a   Zhang, Ping ^a  

^a WESTERN MICHIGAN UNIVERSITY   (United States)

Author keywords

Acyclic resolving partition; Distance; Resolving partition

Indexed keywords

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

References (9)

1. G. Chartrand, H. V. Kronk, and C. E. Wall The point-arboricity of a graph. Israel J. Math. 6 (1968) 169-175.
2. G. Chartrand and H. V. Kronk, The point-arboricity of a planar graph. J. London Math. Soc. 44 (1969) 612-616.
3. G. Chartrand and L. Lesniak, Graphs & Digraphs, third edition. Chapman & Hall, New York (1996).
4. G. Chartrand, E. Salehi, and P. Zhang, The partition dimension of a graph. Aequationes Math. 59 (2000) 45-54.
5. G. Chartrand, D. Erwin, M. A. Henning, P. J. Slater, P. Zhang, The locating-chromatic number of a graph. Bull. Inst. Combin. Appl. To appear.
6. G. Chartrand, D. Erwin, M. A. Henning, P. J. Slater, P. Zhang, On the locating-chromatic number of a graph. Preprint.
7. F. Harary and R. A. Melter, On the metric dimension of a graph. Ars Combin. 2 (1976) 191-195.
8. P.J. Slater, Leaves of trees. Congress. Numer. 14 (1975) 549-559.
9. P.J. Slater, Dominating and reference sets in graphs. J. Math. Phys. Sci. 22 (1988) 445-455.