On the fractional metric dimension of corona product graphs and lexicographic product graphs
arXiv:1206.1906
Abstract
A vertex in a graph resolves two vertices , of if the distance between and is not equal to the distance between and . A function from the vertex set of to is a resolving function of if for any two distinct vertices and , where is the set of vertices resolving and . The real number is the weight of . The minimum weight of all resolving functions for is called the fractional metric dimension of , denoted by . In this paper we reduce the problem of computing the fractional metric dimension of corona product graphs and lexicographic product graphs, to the problem of computing some parameters of the factor graphs.
Cited by in corpus (6)
- The fractional strong metric dimension in three graph products
- The fractional -metric dimension of graphs
- The k-metric dimension of graphs: a general approach
- Local fractional metric dimension of rotationally symmetric planar graphs arisen from planar chorded cycles
- The -metric dimension of the lexicographic product of graphs
- Simultaneous Resolvability in Families of Corona Product Graphs