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 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 resolvability of a graph associated to a finite vector space

2019 ◽  
Vol 18 (02) ◽  
pp. 1950029
Author(s):  
U. Ali ◽  
S. A. Bokhary ◽  
K. Wahid ◽  
G. Abbas
Keyword(s):  
Vector Space ◽  
Domination Number ◽  
Exchange Property ◽  
Metric Dimension ◽  
Resolving Set ◽  
Matroid Intersection ◽  
Finite Vector ◽  
Finite Vector Space ◽  
Partition Dimension ◽  
Matroid Intersection Problem

In this paper, the resolving parameters such as metric dimension and partition dimension for the nonzero component graph, associated to a finite vector space, are discussed. The exact values of these parameters are determined. It is derived that the notions of metric dimension and locating-domination number coincide in the graph. Independent sets, introduced by Boutin [Determining sets, resolving set, and the exchange property, Graphs Combin. 25 (2009) 789–806], are studied in the graph. It is shown that the exchange property holds in the graph for minimal resolving sets with some exceptions. Consequently, a minimal resolving set of the graph is a basis for a matroid with the set [Formula: see text] of nonzero vectors of the vector space as the ground set. The matroid intersection problem for two matroids with [Formula: see text] as the ground set is also solved.

scholarly journals Fault-Tolerant Metric Dimension of Generalized Wheels and Convex Polytopes

2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Zhi-Bo Zheng ◽  
Ashfaq Ahmad ◽  
Zaffar Hussain ◽  
Mobeen Munir ◽  
Muhammad Imran Qureshi ◽  
...  
Keyword(s):  
Present Article ◽  
Open Problem ◽  
Ordered Set ◽  
Fault Tolerant ◽  
Convex Polytopes ◽  
Metric Dimension ◽  
Resolving Set ◽  
Minimum Cardinality ◽  
Wheel Graph

For a graph G , an ordered set S ⊆ V G is called the resolving set of G , if the vector of distances to the vertices in S is distinct for every v ∈ V G . The minimum cardinality of S is termed as the metric dimension of G . S is called a fault-tolerant resolving set (FTRS) for G , if S \ v is still the resolving set ∀ v ∈ V G . The minimum cardinality of such a set is the fault-tolerant metric dimension (FTMD) of G . Due to enormous application in science such as mathematics and computer, the notion of the resolving set is being widely studied. In the present article, we focus on determining the FTMD of a generalized wheel graph. Moreover, a formula is developed for FTMD of a wheel and generalized wheels. Recently, some bounds of the FTMD of some of the convex polytopes have been computed, but here we come up with the exact values of the FTMD of two families of convex polytopes denoted as D k for k ≥ 4 and Q k for k ≥ 6 . We prove that these families of convex polytopes have constant FTMD. This brings us to pose a natural open problem about the existence of a polytope having nonconstant FTMD.

Bounds on the partition dimension of convex polytopes

2020 ◽  
Vol 23 ◽  
Author(s):  
Jia-Bao Liu ◽  
Muhammad Faisal Nadeem ◽  
Mohammad Azeem
Keyword(s):  
Combinatorial Optimization ◽  
Computer Science ◽  
Facility Location ◽  
Robot Navigation ◽  
Convex Polytopes ◽  
Pharmaceutical Chemistry ◽  
Resolving Set ◽  
Minimum Number ◽  
Partition Dimension ◽  
Np Problem

Aims and Objective: The idea of partition and resolving sets plays an important role in various areas of engineering, chemistry and computer science such as robot navigation, facility location, pharmaceutical chemistry, combinatorial optimization, networking, and mastermind game. Method: In a graph to obtain the exact location of a required vertex which is unique from all the vertices, several vertices are selected this is called resolving set and its generalization is called resolving partition, where selected vertices are in the form of subsets. Minimum number of partitions of the vertices into sets is called partition dimension. Results: It was proved that determining the partition dimension a graph is nondeterministic polynomial time (NP) problem. In this article, we find the partition dimension of convex polytopes and provide their bounds. Conclusion: The major contribution of this article is that, due to the complexity of computing the exact partition dimension we provides the bounds and show that all the graphs discussed in results have partition dimension either less or equals to 4, but it cannot been be greater than 4.

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.

(ANTI)COMMUTATIVITY OF THE HARMONIC CREATION AND ANNIHILATION OPERATORS

2006 ◽  
Vol 20 (11n13) ◽  
pp. 1808-1818
Author(s):  
S. KUWATA ◽  
A. MARUMOTO
Keyword(s):  
Irreducible Representation ◽  
Harmonic Oscillator ◽  
Linear Algebra ◽  
Commutation Relation ◽  
Complex Number ◽  
Single Mode ◽  
Equation Of Motion ◽  
Sufficient Condition ◽  
Special Linear ◽  
Creation And Annihilation Operators

It is known that para-particles, together with fermions and bosons, of a single mode can be described as an irreducible representation of the Lie (super) algebra 𝔰𝔩2(ℂ) (2-dimensional special linear algebra over the complex number ℂ), that is, they satisfy the equation of motion of a harmonic oscillator. Under the equation of motion of a harmonic oscillator, we obtain the set of the commutation relations which is isomorphic to the irreducible representation, to find that the equation of motion, conversely, can be derived from the commutation relation only for the case of either fermion or boson. If Nature admits of the existence of such a sufficient condition for the equation of motion of a harmonic oscillator, no para-particle can be allowed.

scholarly journals Metric dimension of metric transform and wreath product

2019 ◽  
Vol 11 (2) ◽  
pp. 418-421
Author(s):  
B.S. Ponomarchuk
Keyword(s):  
Wreath Product ◽  
Metric Space ◽  
Metric Spaces ◽  
Metric Dimension ◽  
Hard Problem ◽  
Np Hard ◽  
Resolving Set ◽  
Np Hard Problem ◽  
Metric Transform ◽  
Empty Subset

Let $(X,d)$ be a metric space. A non-empty subset $A$ of the set $X$ is called resolving set of the metric space $(X,d)$ if for two arbitrary not equal points $u,v$ from $X$ there exists an element $a$ from $A$, such that $d(u,a) \neq d(v,a)$. The smallest of cardinalities of resolving subsets of the set $X$ is called the metric dimension $md(X)$ of the metric space $(X,d)$. In general, finding the metric dimension is an NP-hard problem. In this paper, metric dimension for metric transform and wreath product of metric spaces are provided. It is shown that the metric dimension of an arbitrary metric space is equal to the metric dimension of its metric transform.

scholarly journals Resolving Sets and Semi-Resolving Sets in Finite Projective Planes

10.37236/2582 ◽  
2012 ◽  
Vol 19 (4) ◽  
Author(s):  
Tamás Héger ◽  
Marcella Takáts
Keyword(s):  
Projective Plane ◽  
Finite Projective Plane ◽  
Projective Planes ◽  
The Other ◽  
Blocking Set ◽  
Metric Dimension ◽  
Desarguesian Projective Plane ◽  
Resolving Set ◽  
Incidence Graph ◽  
Vertex Set

In a graph $\Gamma=(V,E)$ a vertex $v$ is resolved by a vertex-set $S=\{v_1,\ldots,v_n\}$ if its (ordered) distance list with respect to $S$, $(d(v,v_1),\ldots,d(v,v_n))$, is unique. A set $A\subset V$ is resolved by $S$ if all its elements are resolved by $S$. $S$ is a resolving set in $\Gamma$ if it resolves $V$. The metric dimension of $\Gamma$ is the size of the smallest resolving set in it. In a bipartite graph a semi-resolving set is a set of vertices in one of the vertex classes that resolves the other class.We show that the metric dimension of the incidence graph of a finite projective plane of order $q\geq 23$ is $4q-4$, and describe all resolving sets of that size. Let $\tau_2$ denote the size of the smallest double blocking set in PG$(2,q)$, the Desarguesian projective plane of order $q$. We prove that for a semi-resolving set $S$ in the incidence graph of PG$(2,q)$, $|S|\geq \min \{2q+q/4-3, \tau_2-2\}$ holds. In particular, if $q\geq9$ is a square, then the smallest semi-resolving set in PG$(2,q)$ has size $2q+2\sqrt{q}$. As a corollary, we get that a blocking semioval in PG$(2, q)$, $q\geq 4$, has at least $9q/4-3$ points. A corrigendum was added to this paper on March 3, 2017.

scholarly journals The Laplacian Energy of Conjugacy Class Graph of Some Finite Groups

MATEMATIKA ◽  
2019 ◽  
Vol 35 (1) ◽  
pp. 59-65
Author(s):  
Rabiha Mahmoud ◽  
Amira Fadina Ahmad Fadzil ◽  
Nor Haniza Sarmin ◽  
Ahmad Erfanian
Keyword(s):  
Conjugacy Class ◽  
Finite Groups ◽  
Dihedral Group ◽  
Dihedral Groups ◽  
Laplacian Eigenvalues ◽  
Laplacian Matrices ◽  
Laplacian Energy ◽  
The Difference ◽  
Generalized Quaternion ◽  
Class Graph

Let G be a dihedral group and its conjugacy class graph. The Laplacian energy of the graph, is defined as the sum of the absolute values of the difference between the Laplacian eigenvalues and the ratio of twice the edges number divided by the vertices number. In this research, the Laplacian matrices of the conjugacy class graph of some dihedral groups, generalized quaternion groups, quasidihedral groups and their eigenvalues are first computed. Then, the Laplacian energy of the graphs are determined.

Sign in / Sign up

Export Citation Format

Share Document