On the local (adjacency) metric dimension of split related wheel graphs

The comparative analysis of metric and edge metric dimension of some subdivisions of the wheel graph

Asian-European Journal of Mathematics ◽

10.1142/s1793557121500625 ◽

2020 ◽

pp. 2150062

Author(s):

Zahid Raza ◽

M. S. Bataineh

Keyword(s):

Comparative Analysis ◽

Metric Dimension ◽

Wheel Graph ◽

Wheel Graphs ◽

Metric Dimensions ◽

Appl Math

The aim of this study is to compute the edge metric dimension of some subdivision of the wheel graphs. In particular, we determine and compare the metric and edge metric dimensions of the graphs obtained after the cycle, spoke and barycentric subdivisions of the wheel graph. Furthermore, some families of graphs have been constructed through subdivision process for which [Formula: see text], and also [Formula: see text] which partially answer a question in [A. Kelenc, N. Tratnik and I. G. Yero, Uniquely identifying the edges of a graph: The edge metric dimension, Discrete Appl. Math. 251 (2018) 204–220].

Download Full-text

Minimum Partition of an r − Independence System

Journal of Mathematics ◽

10.1155/2021/7163840 ◽

2021 ◽

Vol 2021 ◽

pp. 1-10

Author(s):

Zill-e-Shams ◽

Muhammad Salman ◽

Zafar Ullah ◽

Usman Ali

Keyword(s):

Graph Partitioning ◽

Applied Mathematics ◽

Independent Set ◽

Maximal Independent Set ◽

Metric Dimension ◽

Partition Problem ◽

Maximum Cardinality ◽

Minimal Set ◽

Independence System ◽

Wheel Graphs

Graph partitioning has been studied in the discipline between computer science and applied mathematics. It is a technique to distribute the whole graph data as a disjoint subset to a different device. The minimum graph partition problem with respect to an independence system of a graph has been studied in this paper. The considered independence system consists of one of the independent sets defined by Boutin. We solve the minimum partition problem in path graphs, cycle graphs, and wheel graphs. We supply a relation of twin vertices of a graph with its independence system. We see that a maximal independent set is not always a minimal set in some situations. We also provide realizations about the maximum cardinality of a minimum partition of the independence system. Furthermore, we study the comparison of the metric dimension problem of a graph with the minimum partition problem of that graph.

Download Full-text

The Vertex-Edge Resolvability of Some Wheel-Related Graphs

Journal of Mathematics ◽

10.1155/2021/1859714 ◽

2021 ◽

Vol 2021 ◽

pp. 1-16

Author(s):

Bao-Hua Xing ◽

Sunny Kumar Sharma ◽

Vijay Kumar Bhat ◽

Hassan Raza ◽

Jia-Bao Liu

Keyword(s):

Connected Graph ◽

Metric Dimension ◽

Resolving Set ◽

Minimum Cardinality ◽

Wheel Graph ◽

Wheel Graphs ◽

Metric Dimensions ◽

Mixed Metric

A vertex w ∈ V H distinguishes (or resolves) two elements (edges or vertices) a , z ∈ V H ∪ E H if d w , a ≠ d w , z . A set W m of vertices in a nontrivial connected graph H is said to be a mixed resolving set for H if every two different elements (edges and vertices) of H are distinguished by at least one vertex of W m . The mixed resolving set with minimum cardinality in H is called the mixed metric dimension (vertex-edge resolvability) of H and denoted by m dim H . The aim of this research is to determine the mixed metric dimension of some wheel graph subdivisions. We specifically analyze and compare the mixed metric, edge metric, and metric dimensions of the graphs obtained after the wheel graphs’ spoke, cycle, and barycentric subdivisions. We also prove that the mixed resolving sets for some of these graphs are independent.

Download Full-text

A STUDY ON ZERO-M CORDIAL LABELING

Advances in Mathematics: Scientific Journal ◽

10.37418/amsj.9.11.26 ◽

2020 ◽

Vol 9 (11) ◽

pp. 9207-9218

Author(s):

A. Neerajah ◽

P. Subramanian

Keyword(s):

Wheel Graphs

A labeling $f: E(G) \rightarrow \{1, -1\}$ of a graph G is called zero-M-cordial, if for each vertex v, the arithmetic sum of the labels occurrence with it is zero and $|e_{f}(-1) - e_{f}(1)| \leq 1$. A graph G is said to be Zero-M-cordial if a Zero-M-cordial label is given. Here the exploration of zero - M cordial labelings for deeds of paths, cycles, wheel and combining two wheel graphs, two Gear graphs, two Helm graphs. Here, also perceived that a zero-M-cordial labeling of a graph need not be a H-cordial labeling.

Download Full-text

Power graphs and exchange property for resolving sets

Open Mathematics ◽

10.1515/math-2019-0093 ◽

2019 ◽

Vol 17 (1) ◽

pp. 1303-1309 ◽

Cited By ~ 1

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.

Download Full-text

Metric Dimension Parameterized By Treewidth

Algorithmica ◽

10.1007/s00453-021-00808-9 ◽

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.

Download Full-text