Ubaya Repository (University of Surabaya) · 2008 · 18 citations · 6 references
Open access
Natural SciencesComputer ScienceMathematicsCombinatoricsGeometryRepresentation TheoryDimensional AnalysisGeometric GraphsGraph AlgorithmsGraph TheoryGraphical RepresentationMetric GeometryMetric Graph TheoryVertex DistanceVertex Representation
For an ordered set W = {w_1,w_2,...,w_k} of vertices and a vertex \nv in a connected graph G, the representation of v with respect to \nW is the ordered k-tuple r(v|W) = (d(v,w_1), d(v,w_2),..., d(v,w_k)) \nwhere d(x,y) represents the distance between the vertices x and y. \nThe set W is called a resolving set for G if every two vertices of G \nhave distinct representations. A resolving set containing a minimum \nnumber of vertices is called a basis for G. The dimension of G, \ndenoted by dim(G), is the number of vertices in a basis of G. In this \npaper, we determine the dimensions of some corona graphs G⊙K_1, \nand G⊙K_m for any graph G and m ≥ 2, and a graph with pendant \nedges more general than corona graphs G⊙K_m.
6
Resolvability in graphs and the metric dimension of a graph
Gary Chartrand, Linda Eroh, Mark A. Johnson et al. · Discrete Applied Mathematics · 2000 · 982 citations
On the Metric Dimension of Cartesian Products of Graphs
José Cáceres, Carmen Hernando, Mercè Ferrater Mora et al. · SIAM Journal on Discrete Mathematics · 2007 · 474 citations · Full text
On k-dimensional graphs and their bases
Peter S. Buczkowski, Gary Chartrand, Christopher Poisson et al. · Periodica Mathematica Hungarica · 2003 · 167 citations
On the metric dimension of some families of graphs
Carmen Hernando, Mercè Ferrater Mora, Ignacio M. Pelayo et al. · Electronic Notes in Discrete Mathematics · 2005 · 165 citations
The metric dimension of Cayley digraphs
Melodie Fehr, Shonda Gosselin, Ortrud R. Oellermann · Discrete Mathematics · 2006 · 118 citations