The K-Size Edge Metric Dimension of Graphs
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...
Main Authors: | Tanveer Iqbal, Muhammad Naeem Azhar, Syed Ahtsham Ul Haq Bokhary |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2020-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2020/1023175 |
Similar Items
-
On the metric dimension of rotationally-symmetric convex polytopes
by: Muhammad Imran, et al.
Published: (2016-05-01) -
Edge Irregular Reflexive Labeling for the Disjoint Union of Gear Graphs and Prism Graphs
by: Xiujun Zhang, et al.
Published: (2018-08-01) -
Domination and Power Domination in Certain Families of Nanostars Dendrimers
by: Tanveer Iqbal, et al.
Published: (2020-01-01) -
Optimal Graphs in the Enhanced Mesh Networks
by: Muhammad Shahzad Akhtar, et al.
Published: (2020-01-01) -
Metric dimension and edge metric dimension of windmill graphs
by: Pradeep Singh, et al.
Published: (2021-06-01)