On metric dimension of permutation graphs

2013 ◽  
Vol 28 (4) ◽  
pp. 814-826 ◽  
Author(s):  
Michael Hallaway ◽  
Cong X. Kang ◽  
Eunjeong Yi
Keyword(s):  
Metric Dimension ◽  
Permutation Graphs

scholarly journals Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity

Algorithmica ◽  
2016 ◽  
Vol 78 (3) ◽  
pp. 914-944 ◽  
Author(s):  
Florent Foucaud ◽  
George B. Mertzios ◽  
Reza Naserasr ◽  
Aline Parreau ◽  
Petru Valicov
Keyword(s):  
Metric Dimension ◽  
Permutation Graphs ◽  
Algorithms And Complexity

scholarly journals Identification, location–domination and metric dimension on interval and permutation graphs. I. Bounds

2017 ◽  
Vol 668 ◽  
pp. 43-58 ◽  
Author(s):  
Florent Foucaud ◽  
George B. Mertzios ◽  
Reza Naserasr ◽  
Aline Parreau ◽  
Petru Valicov
Keyword(s):  
Metric Dimension ◽  
Permutation Graphs

scholarly journals Power graphs and exchange property for resolving sets

2019 ◽  
Vol 17 (1) ◽  
pp. 1303-1309 ◽  
Author(s):  
Ghulam Abbas ◽  
Usman Ali ◽  
Mobeen Munir ◽  
Syed Ahtsham Ul Haq Bokhary ◽  
Shin Min Kang
Keyword(s):  
Present Article ◽  
Linear Algebra ◽  
Finite Groups ◽  
Robot Navigation ◽  
Simple Graph ◽  
Exchange Property ◽  
Metric Dimension ◽  
Sufficient Condition ◽  
Resolving Set ◽  
Dihedral Groups

Abstract Classical applications of resolving sets and metric dimension can be observed in robot navigation, networking and pharmacy. In the present article, a formula for computing the metric dimension of a simple graph wihtout singleton twins is given. A sufficient condition for the graph to have the exchange property for resolving sets is found. Consequently, every minimal resolving set in the graph forms a basis for a matriod in the context of independence defined by Boutin [Determining sets, resolving set and the exchange property, Graphs Combin., 2009, 25, 789-806]. Also, a new way to define a matroid on finite ground is deduced. It is proved that the matroid is strongly base orderable and hence satisfies the conjecture of White [An unique exchange property for bases, Linear Algebra Appl., 1980, 31, 81-91]. As an application, it is shown that the power graphs of some finite groups can define a matroid. Moreover, we also compute the metric dimension of the power graphs of dihedral groups.

scholarly journals Metric Dimension Parameterized By Treewidth

Algorithmica ◽  
2021 ◽  
Author(s):  
Édouard Bonnet ◽  
Nidhi Purohit
Keyword(s):  
Computable Function ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Minimum Size ◽  
Metric Dimension ◽  
Resolving Set ◽  
Input Graph ◽  
Outerplanar Graphs ◽  
Bounded Treewidth ◽  
Fpt Algorithm

AbstractA resolving set S of a graph G is a subset of its vertices such that no two vertices of G have the same distance vector to S. The Metric Dimension problem asks for a resolving set of minimum size, and in its decision form, a resolving set of size at most some specified integer. This problem is NP-complete, and remains so in very restricted classes of graphs. It is also W[2]-complete with respect to the size of the solution. Metric Dimension has proven elusive on graphs of bounded treewidth. On the algorithmic side, a polynomial time algorithm is known for trees, and even for outerplanar graphs, but the general case of treewidth at most two is open. On the complexity side, no parameterized hardness is known. This has led several papers on the topic to ask for the parameterized complexity of Metric Dimension with respect to treewidth. We provide a first answer to the question. We show that Metric Dimension parameterized by the treewidth of the input graph is W[1]-hard. More refinedly we prove that, unless the Exponential Time Hypothesis fails, there is no algorithm solving Metric Dimension in time $$f(\text {pw})n^{o(\text {pw})}$$ f ( pw ) n o ( pw ) on n-vertex graphs of constant degree, with $$\text {pw}$$ pw the pathwidth of the input graph, and f any computable function. This is in stark contrast with an FPT algorithm of Belmonte et al. (SIAM J Discrete Math 31(2):1217–1243, 2017) with respect to the combined parameter $$\text {tl}+\Delta$$ tl + Δ , where $$\text {tl}$$ tl is the tree-length and $$\Delta$$ Δ the maximum-degree of the input graph.

scholarly journals Mixed metric dimension of graphs with edge disjoint cycles

2021 ◽  
Vol 300 ◽  
pp. 1-8
Author(s):  
Jelena Sedlar ◽  
Riste Škrekovski
Keyword(s):  
Metric Dimension ◽  
Edge Disjoint ◽  
Disjoint Cycles ◽  
Mixed Metric

Metric and Strong Metric Dimension in Cozero-Divisor Graphs

2021 ◽  
Vol 18 (3) ◽  
Author(s):  
R. Nikandish ◽  
M. J. Nikmehr ◽  
M. Bakhtyiari
Keyword(s):  
Metric Dimension ◽  
Strong Metric Dimension

scholarly journals Bounds of Fractional Metric Dimension and Applications with Grid-Related Networks

Mathematics ◽  
2021 ◽  
Vol 9 (12) ◽  
pp. 1383
Author(s):  
Ali H. Alkhaldi ◽  
Muhammad Kamran Aslam ◽  
Muhammad Javaid ◽  
Abdulaziz Mohammed Alanazi
Keyword(s):  
Metric Dimension ◽  
Hard Problem ◽  
Np Hard ◽  
Weighted Version ◽  
Sharp Bounds ◽  
Np Hard Problem ◽  
Metric Dimensions

Metric dimension of networks is a distance based parameter that is used to rectify the distance related problems in robotics, navigation and chemical strata. The fractional metric dimension is the latest developed weighted version of metric dimension and a generalization of the concept of local fractional metric dimension. Computing the fractional metric dimension for all the connected networks is an NP-hard problem. In this note, we find the sharp bounds of the fractional metric dimensions of all the connected networks under certain conditions. Moreover, we have calculated the fractional metric dimension of grid-like networks, called triangular and polaroid grids, with the aid of the aforementioned criteria. Moreover, we analyse the bounded and unboundedness of the fractional metric dimensions of the aforesaid networks with the help of 2D as well as 3D plots.

Sign in / Sign up

Export Citation Format

Share Document