On the fractional metric dimension of corona product graphs and lexicographic product graphs

preprint2012arXivOpen access

Abstract

A vertex xx in a graph GG resolves two vertices uu, vv of GG if the distance between uu and xx is not equal to the distance between vv and xx. A function gg from the vertex set of GG to [0,1][0,1] is a resolving function of GG if g(RG{u,v})≥1g(R_G\{u,v\})\geq 1 for any two distinct vertices uu and vv, where RG{u,v}R_G\{u,v\} is the set of vertices resolving uu and vv. The real number ∑v∈V(G)g(v)\sum_{v\in V(G)}g(v) is the weight of gg. The minimum weight of all resolving functions for GG is called the fractional metric dimension of GG, denoted by dim⁡f(G)\dim_f(G). 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.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.