Fractional Metric Dimension of Generalized Jahangir Graph

: Arumugam and Mathew [ Discret. Math. 2012 , 312 , 1584–1590] introduced the notion of fractional metric dimension of a connected graph. In this paper, a combinatorial technique is devised to compute it. In addition, using this technique the fractional metric dimension of the generalized Jahangir graph J m , k is computed for k ≥ 0 and m = 5.


Introduction and Preliminaries
In this paper, G = (V(G), E(G)) is a finite, undirected, connected and simple graph of order |V(G)| and size |E(G)|.For any two vertices u, v ∈ V(G), the distance d(u, v) is the length of a shortest path u ∼ v in G.For graph theoretic terminology, we refer to [1][2][3].
An ordered set of vertices, we mean a set W = {w 1 , w 2 , . . ., w k } on which the ordering (w 1 , w 2 , . . ., w k ) has been imposed.For an ordered subset W = {w 1 , w 2 , . . ., w k } of V(G), we refer to the k-vector (ordered k-tuple) r(v|W) = (d(v, w 1 ), d(v, w 2 ), . . ., d(v, w k )) as the (metric) representation of v with respect to W. The set W is called a resolving set for G if r(u|W) = r(v|W) implies that u = v for all u, v ∈ V(G).Hence, if W is a resolving set of cardinality k for a graph G of order n, then the set {r(v|W The collection of all such x in V(G) is called resolving neighbourhood of the pair {u, v}, denoted by R{u, v}.Explicitly, R{u, v} = {x ∈ V(G) : d(u, x) = d(v, x)}.Let V p denote the collection of all ( |V(G)| 2 ) pairs of vertices of G. Then for each x ∈ V(G) the set R{x} = {{u, v} ∈ V p : d(u, x) = d(v, x)} is called resolvent neighbourhood of x.Definition 1 ([4]).Let G = (V(G), E(G)) be a connected graph of order n.A function f : V(G) → [0, 1] is called a resolving function (RF) of G if f (R{u, v}) ≥ 1 for any two distinct vertices u, v ∈ V(G), where f (R{u, v}) = ∑ x∈R{u,v} f (x).A resolving function g of a graph G is minimal (MRF) if any function f : V(G) → [0, 1] such that f ≤ g and f (v) = g(v) for at least one v ∈ V(G) is not a resolving function of G.Then, the fractional metric dimension of the graph G is dim f (G) = min{|g| : g is a minimal resolving function of G}, where |g| = ∑ v∈V(G) g(v).
In [5,6], Slatter introduced the notion of resolving set of a connected graph under the term locating set.Harary and Melter in [7], independently discovered these concepts and termed them as the metric dimension of graph.Resolving sets enjoy their several applications in various areas of computer sciences such as network discovery and verification [8], robot navigation [9], mastermind game [10], coin weighing problem [11], integer programming [12] and drug discovery [13].The problem of finding metric dimension of a graph as an integer programming problem (IPP) has been introduced by Chartrand et al. [13], and independently by Currie and Oellermann [12].As a further refinement, Currie and Oellermann [8] devised the notion of fractional metric dimension as the optimal solution of the linear relaxation of the IPP.An equivalent formulation for the fractional metric dimension of a graph has been proposed by Fehr et al. [14] as follows: Suppose V = {v 1 , v 2 , . . ., v n } and V p = {s 1 , s 2 , . . ., s ( n 2 ) }. Let A = (a ij ) be the ( n 2 )×n matrix with a ij = 1 if s i v j ∈ E(R(G)) and 0 otherwise, where 1 ≤ i ≤( n 2 ) and 1 ≤ j ≤ n.The IPP of the metric dimension is given by; Minimize f (x 1 , x 2 , . . ., x n ) = x 1 + x 2 +, . . ., +x n subject to A x ≥ 1, where x = (x 1 , x 2 , . . ., x n ) T , x i ∈ {0, 1} and 1 is the ( n 2 )×1 column vector with all entries as 1.The optimal solution of the aforementioned linear programming relaxation, with replacement x i ∈ {0, 1} by 0 ≤ x i ≤ 1 gives the fractional metric dimension of G, represented by dim f (G).The optimal solution of the dual of this LPP is referred to as the metric independence number of G (mi f (G)).Therefore, the duality and weak duality theorem in linear programming implies that mi(G) ≤ mi f (G) = dim f (G) ≤ dim(G), as discussed by Arumugam and Mathew in [4].For further details of the duality and weak duality theorem, we refer to [15].
In [16] The vertices of the generalized Jahangir graph J m,k can be classified into three different types.The vertices of degree 2, 3 and m are respectively named as minors, major and center.The generalized Jahangir graph J m,k have km minor vertices, m major vertices and one center vertex.In this article, we have discussed results for m = 5, shown in Figure 1.For k = 1, the generalized Jahangir graph J m,k is the Jahangir graph J 2m , for m ≥ 4, discussed by Tomescu et al. in [17].
Arumugam and Mathew [4] formally introduced the notion of fractional metric dimension and discussed some fundamental results.The fractional metric dimension of the cartesian product, hierarchical product, corona product, lexicographic product and comb product of connected graphs, see [18][19][20][21].YI [22] computed the fractional metric dimension of permutation graphs.Mainly, Arumugama et al. [4] studied the graphs whose fractional metric dimension graphs equals half of their orders and Feng et al. [23] investigated the fractional metric dimension of vertex transitive and distance regular graphs.This motivated us to devise a criterion to compute fractional metric dimension of those graphs which are neither vertex transitive and distance regular graphs nor their fractional metric dimension is half of their orders.In particular, the criterion is applied to compute fractional metric dimension of the generalized Jahangir graph J m,k for k ≥ 0 and m = 5.
The paper is organized as follows: Section 1 is for introduction and preliminaries and in Section 2, the resolving neighbourhood of each possible pair of the vertices of the generalized Jahangir graph J m,k for k ≥ 0 and m = 5 are obtained.The main results are included in Section 3. Finally, the paper is concluded with some future prospects in Section 4.

Resolving Neighbourhoods of the Generalized Jahangir Graph
The possible pairs of vertices of the generalized Jahangir graph J m,k for k ≥ 1 and m = 5 are majors with majors, major with minors, center with majors, center with minors, and minors with minors.In this section, the resolving neighbourhoods for each pair of vertices of J m,k k ≥ 0 and m = 5 are classified.
Lemma 1.Let J m,k be the generalized Jahangir graph for k ≥ 4 and m = 5.Then In the following lemma resolving neighbourhoods of the center vertex with major vertices in J 5,k are computed.
Lemma 2. Let J m,k be the generalized Jahangir graph for k ≥ 4 and m = 5.
Proof.For k ≡ 0 (mod 2), the resolving neighbourhood R{u, In the following lemma resolving neighbourhoods of center vertex with minor vertices in J 5,k are computed.Lemma 3. Let J m,k be the generalized Jahangir graph for k ≥ 4 and m = 5. Proof.
Case 1: ), and the case is easy to see.This completes the proof.
In the following lemma resolving neighbourhoods of the pair of major vertices in J 5,k are computed.Lemma 4. Let J m,k be the generalized Jahangir graph for k ≥ 4 and m = 5.
Proof.The symmetry of the generalized Jahangir graph J 5,k allows us to discuss only the following case: Case 1: (When k ≡ 0 (mod 2) and p = 1) In the following lemma resolving neighbourhoods of major vertices with minor vertices in J 5,k are computed.Lemma 5. Let J m,k be the generalized Jahangir graph for k ≥ 4 and m = 5. Proof.
Case 1: (When k ≡ 0 (mod 2) and p = 0) } for j is even and odd respectively.Also, |R{u i , In this case, the resolving neighbourhoods are R{u In this case, the resolving neighbourhoods are R{u i , i+2 } for odd j and i+2 } for even j ∈ {4, . . ., k−1 2 }.Therefore, in each of the above cases |R{u i , v j i+2 }| = 5k + 6, 4k + k+7 2 and 5k + 4 respectively, is greater than In the following lemma resolving neighbourhoods of each pair of minor vertices in J 5,k are computed.Lemma 6.Let J m,k be the generalized Jahangir graph for k ≥ 4 and m = 5. Proof.

Case 3: When
The resolving neighbourhood of any pair of consecutive major vertices u The resolving neighbourhood of the pair of minors for n = 6.It is to be noted that the graph W 6 is a special case of the generalized Jahangir graph J m,k for m = 5, k = 0. Also, the fractional dimension dim f (J m,k ) = 3 2 for m = 5, k = 0 computed above is in consensus with [4].Proof.In view of Lemma 1, and β = | ∪ 4 i=0 R i | = 5k.Also from Lemma 2 to Lemma 6 , |R { v k i−1 , v 1 i }| ≤ |R{x, y}| for all x, y ∈ V(J 5,k ) such that x = v k i−1 and y = v 1 i .Therefore, from the criteria given in Lemma 7, the fractional metric of J 5,k is given as follows: Here, β = β = 5k.This implies This completes the proof.

Theorem 2 .
The fractional metric dimension of the generalized Jahangir graph J m,k for k ≥ 4 and m = 5 is dim f (J m,k ) =

Theorem 3 .
The fractional metric dimension of the generalized Jahangir graph J m,k is 5 2 for m = 5, k = 4 and 25 8 for m = 5, k = 5.
The generalized Jahangir graph J m,k , for m ≥ 3, k ≥ 1, is a graph on m(k + 1) + 1 vertices i.e., a graph consisting of a cycle C m(k+1) with one additional vertex which is adjacent to m vertices of C m(k+1) at distance k + 1 to each other on C m(k+1) .The vertex set of J , Ali et al. introduced the generalized Jahangir graph as follows: Definition 2.