Periodica Mathematica Hungarica

, Volume 46, Issue 1, pp 9–15 | Cite as

On k-dimensional graphs and their bases

  • Peter S. Buczkowski
  • Gary Chartrand
  • Christopher Poisson
  • Ping Zhang
Article
resolving set dimension basis 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

REFERENCES

  1. [1]
    G. Chartand, L. Eroh, M. Johnson and O. R. Oellermann, Resolvability in graphs and the metric dimension of graph. Discrete Appl.Math. 105 (2000), 99–113.Google Scholar
  2. [2]
    F. Hardy and R. A. Melter, On the metric dimension of a graph. Ars Combin. 2 (1976), 191–195.Google Scholar
  3. [3]
    P. J. Slater, Leaves of trees. Congress.Numer. 14 (1975), 549–559.Google Scholar
  4. [4]
    P. J. Slater, Dominating and reference sets in graphs. J.Math.Phys.Sci. 22 (1988), 445–455.Google Scholar

Copyright information

© Kluwer Academic Publisher/Akadémiai Kiadó 2003

Authors and Affiliations

  • Peter S. Buczkowski
    • 1
  • Gary Chartrand
    • 1
  • Christopher Poisson
    • 1
  • Ping Zhang
    • 1
  1. 1.Department of Mathematics and StatisticsWestern Michigan UniversityKalamazooUSA

Personalised recommendations