Procedia Computer Science · 2015 · 16 citations · 8 references
Natural SciencesMathematicsCombinatoricsComputational GeometryGeometryAlgebraic GeometryDimension TheoryDirected Acyclic GraphsGeometric GraphsGraph TheoryMetric GeometryMetric Graph TheoryTree-graphVertex Distance
A vertex v in a simple connected graph G resolves two vertices x and y in G if the distance from x to v is not equal to distance from y to v. The vertex set R{x, y} is defined as the set of vertices in G which resolve x and y. A function f : V(G) → [0,1] is called a resolving function of G if f (R{x, y}) ≥ 1 for any two distinct vertices x and y in G. The minimal value of f (V(G)) for all resolving functions f of G is called the fractional metric dimension of G. In this paper, we determine the fractional metric dimension of Gwhere G is a tree or G is a unicyclic graph.
8
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
Samir Khuller, Balaji Raghavachari, Azriel Rosenfeld · Discrete Applied Mathematics · 1996 · 808 citations
A Combinatory Detection Problem
Staffan Söderberg, H. S. Shapiro · American Mathematical Monthly · 1963 · 171 citations
The fractional metric dimension of graphs
S. Arumugam, Varughese Mathew · Discrete Mathematics · 2011 · 76 citations