scholarly journals Fractional Metric Dimension of Generalized Jahangir Graph

Mathematics ◽  
2019 ◽  
Vol 7 (1) ◽  
pp. 100 ◽  
Author(s):  
Jia-Bao Liu ◽  
Agha Kashif ◽  
Tabasam Rashid ◽  
Muhammad Javaid
Keyword(s):  
Connected Graph ◽  
Metric Dimension ◽  
Combinatorial Technique ◽  
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 .

scholarly journals The metric dimension of strong product graphs

2015 ◽  
Vol 31 (2) ◽  
pp. 261-268
Author(s):  
JUAN A. RODRIGUEZ-VELAZQUEZ ◽  
◽  
DOROTA KUZIAK ◽  
ISMAEL G. YERO ◽  
JOSE M. SIGARRETA ◽  
...  
Keyword(s):  
Connected Graph ◽  
Metric Dimension ◽  
Np Hard ◽  
Strong Product ◽  
Product Graphs ◽  
Metric Basis

For an ordered subset S = {s1, s2, . . . sk} of vertices in a connected graph G, the metric representation of a vertex u with respect to the set S is the k-vector r(u|S) = (dG(v, s1), dG(v, s2), . . . , dG(v, sk)), where dG(x, y) represents the distance between the vertices x and y. The set S is a metric generator for G if every two different vertices of G have distinct metric representations with respect to S. A minimum metric generator is called a metric basis for G and its cardinality, dim(G), the metric dimension of G. It is well known that the problem of finding the metric dimension of a graph is NP-Hard. In this paper we obtain closed formulae and tight bounds for the metric dimension of strong product graphs.

scholarly journals Metric basis and metric dimension of 1-pentagonal carbon nanocone networks

2020 ◽  
Vol 10 (1) ◽  
Author(s):  
Zafar Hussain ◽  
Mobeen Munir ◽  
Ashfaq Ahmad ◽  
Maqbool Chaudhary ◽  
Junaid Alam Khan ◽  
...  
Keyword(s):  
Combinatorial Chemistry ◽  
Connected Graph ◽  
Cardinal Number ◽  
Metric Dimension ◽  
Molecular Topology ◽  
Resolving Set ◽  
Computer Chemistry ◽  
Carbon Nanocones ◽  
Vertex Set ◽  
Metric Basis

AbstractResolving set and metric basis has become an integral part in combinatorial chemistry and molecular topology. It has a lot of applications in computer, chemistry, pharmacy and mathematical disciplines. A subset S of the vertex set V of a connected graph G resolves G if all vertices of G have different representations with respect to S. A metric basis for G is a resolving set having minimum cardinal number and this cardinal number is called the metric dimension of G. In present work, we find a metric basis and also metric dimension of 1-pentagonal carbon nanocones. We conclude that only three vertices are minimal requirement for the unique identification of all vertices in this network.

On the metric dimension and diameter of circulant graphs with three jumps

2018 ◽  
Vol 10 (01) ◽  
pp. 1850008
Author(s):  
Muhammad Imran ◽  
A. Q. Baig ◽  
Saima Rashid ◽  
Andrea Semaničová-Feňovčíková
Keyword(s):  
Positive Integer ◽  
Connected Graph ◽  
Metric Spaces ◽  
Metric Dimension ◽  
Resolving Set ◽  
Circulant Graphs ◽  
Infinite Class ◽  
Metric Properties ◽  
Minimum Number ◽  
Metric Basis

Let [Formula: see text] be a connected graph and [Formula: see text] be the distance between the vertices [Formula: see text] and [Formula: see text] in [Formula: see text]. The diameter of [Formula: see text] is defined as [Formula: see text] and is denoted by [Formula: see text]. A subset of vertices [Formula: see text] is called a resolving set for [Formula: see text] if for every two distinct vertices [Formula: see text], there is a vertex [Formula: see text], [Formula: see text], such that [Formula: see text]. A resolving set containing the minimum number of vertices is called a metric basis for [Formula: see text] and the number of vertices in a metric basis is its metric dimension, denoted by [Formula: see text]. Metric dimension is a generalization of affine dimension to arbitrary metric spaces (provided a resolving set exists). Let [Formula: see text] be a family of connected graphs [Formula: see text] depending on [Formula: see text] as follows: the order [Formula: see text] and [Formula: see text]. If there exists a constant [Formula: see text] such that [Formula: see text] for every [Formula: see text] then we shall say that [Formula: see text] has bounded metric dimension, otherwise [Formula: see text] has unbounded metric dimension. If all graphs in [Formula: see text] have the same metric dimension, then [Formula: see text] is called a family of graphs with constant metric dimension. In this paper, we study the metric properties of an infinite class of circulant graphs with three generators denoted by [Formula: see text] for any positive integer [Formula: see text] and when [Formula: see text]. We compute the diameter and determine the exact value of the metric dimension of these circulant graphs.

scholarly journals On Metric Dimensions of Symmetric Graphs Obtained by Rooted Product

Mathematics ◽  
2018 ◽  
Vol 6 (10) ◽  
pp. 191 ◽  
Author(s):  
Shahid Imran ◽  
Muhammad Siddiqui ◽  
Muhammad Imran ◽  
Muhammad Hussain
Keyword(s):  
Connected Graph ◽  
The Other ◽  
Metric Dimension ◽  
Resolving Set ◽  
Minimum Cardinality ◽  
Four Dimensions ◽  
Symmetric Graphs ◽  
Metric Dimensions ◽  
Cycle Path

Let G = (V, E) be a connected graph and d(x, y) be the distance between the vertices x and y in G. A set of vertices W resolves a graph G if every vertex is uniquely determined by its vector of distances to the vertices in W. A metric dimension of G is the minimum cardinality of a resolving set of G and is denoted by dim(G). In this paper, Cycle, Path, Harary graphs and their rooted product as well as their connectivity are studied and their metric dimension is calculated. It is proven that metric dimension of some graphs is unbounded while the other graphs are constant, having three or four dimensions in certain cases.

scholarly journals Edge Version of Metric Dimension and Doubly Resolving Sets of the Necklace Graph

Mathematics ◽  
2018 ◽  
Vol 6 (11) ◽  
pp. 243 ◽  
Author(s):  
Jia-Bao Liu ◽  
Zohaib Zahid ◽  
Ruby Nasir ◽  
Waqas Nazeer
Keyword(s):  
Connected Graph ◽  
Metric Dimension ◽  
Necklace Graph

Consider an undirected and connected graph G = ( V G , E G ) , where V G and E G represent the set of vertices and the set of edges respectively. The concept of edge version of metric dimension and doubly resolving sets is based on the distances of edges in a graph. In this paper, we find the edge version of metric dimension and doubly resolving sets for the necklace graph.

Edge version of metric dimension for the families of grid graphs and generalized prism graphs

2020 ◽  
Vol 12 (03) ◽  
pp. 2050037
Author(s):  
Ruby Nasir ◽  
Zohaib Zahid ◽  
Sohail Zafar
Keyword(s):  
Connected Graph ◽  
Metric Dimension ◽  
Grid Graphs ◽  
Metric Basis

The minimum edge version of metric basis is the smallest set [Formula: see text] of edges in a connected graph [Formula: see text] such that for every pair of edges [Formula: see text] [Formula: see text][Formula: see text] there exists an edge [Formula: see text] [Formula: see text][Formula: see text] for which [Formula: see text] [Formula: see text] [Formula: see text] holds. In this paper, the families of grid graphs and generalized prism graphs have been studied for edge version of metric dimension. Edge version of metric dimension is found to be constant for both families of graphs.

scholarly journals Computing Metric Dimension and Metric Basis of 2D Lattice of Alpha-Boron Nanotubes

Symmetry ◽  
2018 ◽  
Vol 10 (8) ◽  
pp. 300 ◽  
Author(s):  
Zafar Hussain ◽  
Mobeen Munir ◽  
Maqbool Chaudhary ◽  
Shin Kang
Keyword(s):  
Electronic Structure ◽  
Transport Properties ◽  
Present Article ◽  
Connected Graph ◽  
Metric Dimension ◽  
Lattice Structures ◽  
Resolving Set ◽  
Minimum Cardinality ◽  
Mathematical Sciences ◽  
Metric Basis

Concepts of resolving set and metric basis has enjoyed a lot of success because of multi-purpose applications both in computer and mathematical sciences. For a connected graph G(V,E) a subset W of V(G) is a resolving set for G if every two vertices of G have distinct representations with respect to W. A resolving set of minimum cardinality is called a metric basis for graph G and this minimum cardinality is known as metric dimension of G. Boron nanotubes with different lattice structures, radii and chirality’s have attracted attention due to their transport properties, electronic structure and structural stability. In the present article, we compute the metric dimension and metric basis of 2D lattices of alpha-boron nanotubes.

scholarly journals On the Edge Metric Dimension of Certain Polyphenyl Chains

2021 ◽  
Vol 2021 ◽  
pp. 1-6
Author(s):  
Muhammad Ahsan ◽  
Zohaib Zahid ◽  
Dalal Alrowaili ◽  
Aiyared Iampan ◽  
Imran Siddique ◽  
...  
Keyword(s):  
Graph Theory ◽  
Connected Graph ◽  
Metric Dimension ◽  
Chain Graph ◽  
Minimum Number ◽  
Valence Bonds

The most productive application of graph theory in chemistry is the representation of molecules by the graphs, where vertices and edges of graphs are the atoms and valence bonds between a pair of atoms, respectively. For a vertex w and an edge f = c 1 c 2 of a connected graph G , the minimum number from distances of w with c 1 and c 2 is called the distance between w and f . If for every two distinct edges f 1 , f 2 ∈ E G , there always exists w 1 ∈ W E ⊆ V G such that d f 1 , w 1 ≠ d f 2 , w 1 , then W E is named as an edge metric generator. The minimum number of vertices in W E is known as the edge metric dimension of G . In this paper, we calculate the edge metric dimension of ortho-polyphenyl chain graph O n , meta-polyphenyl chain graph M n , and the linear [n]-tetracene graph T n and also find the edge metric dimension of para-polyphenyl chain graph L n . It has been proved that the edge metric dimension of O n , M n , and T n is bounded, while L n is unbounded.

scholarly journals The K -Size Edge Metric Dimension of Graphs

2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Tanveer Iqbal ◽  
Muhammad Naeem Azhar ◽  
Syed Ahtsham Ul Haq Bokhary
Keyword(s):  
Bipartite Graph ◽  
Connected Graph ◽  
Complete Bipartite Graph ◽  
Petersen Graph ◽  
Metric Dimension ◽  
Resolving Set ◽  
Generalized Petersen Graph

In this paper, a new concept k -size edge resolving set for a connected graph G in the context of resolvability of graphs is defined. Some properties and realizable results on k -size edge resolvability of graphs are studied. The existence of this new parameter in different graphs is investigated, and the k -size edge metric dimension of path, cycle, and complete bipartite graph is computed. It is shown that these families have unbounded k -size edge metric dimension. Furthermore, the k-size edge metric dimension of the graphs Pm □ Pn, Pm □ Cn for m, n ≥ 3 and the generalized Petersen graph is determined. It is shown that these families of graphs have constant k -size edge metric dimension.

scholarly journals Resolvability in Subdivision of Circulant Networks Cn1,k

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Jianxin Wei ◽  
Syed Ahtsham Ul Haq Bokhary ◽  
Ghulam Abbas ◽  
Muhammad Imran
Keyword(s):  
Facility Location ◽  
Connected Graph ◽  
Location Problems ◽  
Metric Dimension ◽  
Circulant Graph ◽  
Resolving Set ◽  
Minimum Cardinality ◽  
Facility Location Problems ◽  
Wide Range ◽  
Circulant Networks

Circulant networks form a very important and widely explored class of graphs due to their interesting and wide-range applications in networking, facility location problems, and their symmetric properties. A resolving set is a subset of vertices of a connected graph such that each vertex of the graph is determined uniquely by its distances to that set. A resolving set of the graph that has the minimum cardinality is called the basis of the graph, and the number of elements in the basis is called the metric dimension of the graph. In this paper, the metric dimension is computed for the graph Gn1,k constructed from the circulant graph Cn1,k by subdividing its edges. We have shown that, for k=2, Gn1,k has an unbounded metric dimension, and for k=3 and 4, Gn1,k has a bounded metric dimension.

Sign in / Sign up

Export Citation Format

Share Document