Conditional resolvability in graphs: A survey

International Journal of Mathematics and Mathematical Sciences

Volumn 2004, Issue 38, 2004, Pages 1997-2017

  Saenpholphat, Varaporn ^a   Zhang, Ping ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17844386806     PISSN: 01611712     EISSN: None     Source Type: Journal    
DOI: 10.1155/S0161171204311403     Document Type: Review

References (53)

1. R. C. Brigham, G. Chartrand, R. D. Dutton, and P. Zhang, Isometric embeddings of bipartite graphs, Congr. Numer. 154 (2002), 7-12. MathSciNet. Zentralblatt für Mathematik.
2. R. C. Brigham, G. Chartrand, R. D. Dutton, and P. Zhang, Resolving domination in graphs, Math. Bohem. 128 (2003), no. 1, 25-36. MathSciNet. Zentralblatt für Mathematik.
3. P. Buczkowski, G. Chartrand, C. Poisson, and P. Zhang, On k-dimensional graphs and their bases, Period. Math. Hungar. 46 (2003), no. 1, 9-15. CrossRef. MathSciNet. Zentralblatt für Mathematik.
4. G. Chartrand, L. Eroh, M. A. Johnson, and O. R. Oellermann, Resolvability in graphs and the metric dimension of a graph, Discrete Appl. Math. 105 (2000), no. 1-3, 99-113. CrossRef. MathSciNet. Zentralblatt für Mathematik.
5. G. Chartrand, D. Erwin, M. A. Henning, P. J. Slater, and P. Zhang, The locatingchromatic number of a graph, Bull. Inst. Combin. Appl. 36 (2002), 89-101. MathSciNet. Zentralblatt für Mathematik.
6. G. Chartrand, D. Erwin, M. A. Henning, P. J. Slater, and P. Zhang, Graphs of ordern with locating-chromatic number n-1, Discrete Math. 269 (2003), no. 1-3, 65-79. CrossRef. MathSciNet. Zentralblatt für Mathematik.
7. G. Chartrand, D. Erwin, M. Raines, and P. Zhang, The decomposition dimension of graphs, Graphs Combin. 17 (2001), no. 4, 599-605. MathSciNet.
8. G. Chartrand, D. Erwin, P. J. Slater, and P. Zhang, Distance-location numbers of graphs, Util. Math. 63 (2003), 65-79. MathSciNet. Zentralblatt für Mathematik.
9. G. Chartrand, T. W. Haynes, M. A. Henning, and P. Zhang, Stratified claw domination in prisms, J. Combin. Math. Combin. Comput. 33 (2000), 81-96. MathSciNet. Zentralblatt für Mathematik.
10. G. Chartrand, T. W. Haynes, M. A. Henning, and P. Zhang, Stratification and domination in graphs, Discrete Math. 272 (2003), no. 2-3, 171-185. CrossRef. MathSciNet. Zentralblatt für Mathematik.
11. G. Chartrand and H. V. Kronk, The point-arboricity of planar graphs, J. London Math. Soc. 44 (1969), 612-616. MathSciNet. Zentralblatt für Mathematik.
12. G. Chartrand, H. V. Kronk, and C. E. Wall, The point-arboricity of a graph, Israel J. Math. 6 (1968), 169-175. MathSciNet. Zentralblatt für Mathematik.
13. G. Chartrand and L. Lesniak, Graphs & Digraphs, 3rd ed., Chapman & Hall, London, 1996. MathSciNet. Zentralblatt für Mathematik.
14. G. Chartrand, C. Poisson, and P. Zhang, Resolvability and the upper dimension of graphs, Comput. Math. Appl. 39 (2000), no. 12, 19-28. CrossRef. MathSciNet. Zentralblatt für Mathematik.
15. G. Chartrand, M. Raines, and P. Zhang, The directed distance dimension of oriented graphs, Math. Bohem. 125 (2000), no. 2, 155-168. MathSciNet. Zentralblatt für Mathematik.
16. G. Chartrand, M. Raines, and P. Zhang, On the dimension of oriented graphs, Util. Math. 60 (2001), 139-151. MathSciNet. Zentralblatt für Mathematik.
17. G. Chartrand, V. Saenpholphat, and P. Zhang, Resolving edge colorings in graphs, to appear in Ars Combin.
18. G. Chartrand, V. Saenpholphat, and P. Zhang, The independent resolving number of a graph, Math. Bohem. 128 (2003), no. 4, 379-393. MathSciNet.
19. G. Chartrand, E. Salehi, and P. Zhang, The partition dimension of a graph, Aequationes Math. 59 (2000), no. 1-2, 45-54. MathSciNet. Zentralblatt für Mathematik.
20. G. Chartrand and P. Zhang, On the chromatic dimension of a graph, Congr. Numer. 145 (2000), 97-108. MathSciNet. Zentralblatt für Mathematik.
21. G. Chartrand and P. Zhang, The forcing dimension of a graph, Math. Bohem. 126 (2001), no. 4, 711-720. MathSciNet. Zentralblatt für Mathematik.
22. G. Chartrand and P. Zhang, The theory and applications of resolvability in graphs. A survey, Congr. Numer. 160 (2003), 47-68. MathSciNet.
23. G. Chartrand, P. Zhang, and E. Salehi, On the partition dimension of a graph, Congr. Numer. 130 (1998), 157-168. MathSciNet. Zentralblatt für Mathematik.
24. J. Currie and O. R. Oellermann, The metric dimension and metric independence of a graph, J. Combin. Math. Combin. Comput. 39 (2001), 157-167. MathSciNet. Zentralblatt für Mathematik.
25. H. Enomoto, Upper bound of the decomposition dimension of a graph, Congr. Numer. 145 (2000), 157-160. MathSciNet. Zentralblatt für Mathematik.
26. H. Enomoto and T. Nakamigawa, On the decomposition dimension of trees, Discrete Math. 252 (2002), no. 1-3, 219-225. CrossRef. MathSciNet. Zentralblatt für Mathematik.
27. M. R. Garey and D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness, A Series of Books in the Mathematical Sciences, W. H. Freeman, California, 1979. MathSciNet. Zentralblatt für Mathematik.
28. F. Harary and R. A. Melter, On the metric dimension of a graph, Ars Combin. 2 (1976), 191-195. MathSciNet. Zentralblatt für Mathematik.
29. B. L. Hulme, A. W. Shiver, and P. J. Slater, Fire: a Subroutine for Fire Protection Network Analysis, Sandia National Laboratories, New Mexico, 1981, SAND 81-1261.
30. B. L. Hulme, A. W. Shiver, and P. J. Slater, Computing Minimum Cost Fire Protection, Sandia National Laboratories, New Mexico, 1982, SAND 82-0809.
31. B. L. Hulme, A. W. Shiver, and P. J. Slater, A Boolean algebraic analysis of fire protection, Algebraic and Combinatorial Methods in Operations Research, North-Holland Math. Stud., vol. 95, North-Holland Publishing, Amsterdam, 1984, pp. 215-227. MathSciNet. Zentralblatt für Mathematik.
32. M. A. Johnson, Structure-activity maps for visualizing the graph variables arising in drug design, J. Biopharm. Statist 3 (1993), 203-236. Zentralblatt für Mathematik.
33. M. A. Johnson, Browsable structure-activity datasets, Advances in Molecular Similarity (R. Carbó-Dorca and P. Mezey, eds.), JAI Press, Connecticut, 1998, pp. 153-170.
34. S. Khuller, B. Rsghavachari, and A. Rosenfeld, Localization in graphs, Tech. report, University of Maryland, Maryland, 1994.
35. A. Küngen and D. B. West, Decomposition dimension of graphs and a union-free family of sets, preprint, 2001.
36. T. Nakamigawa, A note on the decomposition dimension of complete graphs, Ars Combin. 69 (2003), 161-163. MathSciNet.
37. C. Poisson and P. Zhang, The metric dimension of unicyclic graphs, J. Combin. Math. Combin. Comput. 40 (2002), 17-32. MathSciNet. Zentralblatt für Mathematik.
38. M. Raines and P. Zhang, The Steiner distance dimension of graphs, Australas. J. Combin. 20 (1999), 133-143. MathSciNet. Zentralblatt für Mathematik.
39. D. F. Rail and P. J. Slater, On location-domination numbers for certain classes of graphs, Congr. Numer. 45 (1984), 97-106. MathSciNet. Zentralblatt für Mathematik.
40. V. Saenpholphat and P. Zhang, On connected resolving decompositions in graphs, to appear in Czechoslovak Math. J.
41. V. Saenpholphat and P. Zhang, Connected partition dimensions of graphs, Discuss. Math. Graph Theory 22 (2002), no. 2, 305-323. MathSciNet. Zentralblatt für Mathematik.
42. V. Saenpholphat and P. Zhang, Some results on connected resolvability in graphs, Congr. Numer. 158 (2002), 5-19. MathSciNet. Zentralblatt für Mathematik.
43. V. Saenpholphat and P. Zhang, Connected resolvability of graphs, Czechoslovak Math. J. 53(128) (2003), no. 4, 827-840. CrossRef. MathSciNet.
44. V. Saenpholphat and P. Zhang, Connected resolving decompositions in graphs, Math. Bohem. 128 (2003), no. 2, 121-136. MathSciNet. Zentralblatt für Mathematik.
45. V. Saenpholphat and P. Zhang, Connected resolving sets in graphs, Ars Combin. 68 (2003), 3-16. MathSciNet.
46. V. Saenpholphat and P. Zhang, On connected resolvability of graphs, Australas. J. Combin. 28 (2003), 25-37. MathSciNet. Zentralblatt für Mathematik.
47. V. Saenpholphat and P. Zhang, On resolving edge colorings in graphs, Int. J. Math. Math. Sci. (2003), no. 46, 2947-2959. CrossRef. MathSciNet. Zentralblatt für Mathematik.
48. V. Saenpholphat and P. Zhang, On resolving acyclic partitions of graphs, Ars Combin. 71 (2004), 65-78.
49. V. Saenpholphat and P. Zhang, Resolving acyclic partitions of graphs, Ars Combin. 70 (2004), 61-74.
50. P. J. Slater, Leaves of trees, Proc. 6th Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla, 1975), Congressus Numerantium, no. 14, Utilitas Math., Winnipeg, Manitoba, 1975, pp. 549-559. MathSciNet. Zentralblatt für Mathematik.
51. P. J. Slater, Domination and location in acyclic graphs, Networks 17 (1987), no. 1, 55-64. MathSciNet. Zentralblatt für Mathematik.
52. P. J. Slater, Dominating and reference sets in a graph, J. Math. Phys. Sci. 22 (1988), no. 4, 445-455. MathSciNet. Zentralblatt für Mathematik.
53. V. G. Vizing, On an estimate of the chromatic class of a p-graph, Diskret. Analiz No. 3 (1964), 25-30. MathSciNet.