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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.