The K-Size Edge Metric Dimension of Graphs
Joint Authors
Iqbal, Tanveer
Azhar, Muhammad Naeem
Ul Haq Bokhary, Syed Ahtsham
Source
Issue
Vol. 2020, Issue 2020 (31 Dec. 2020), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2020-12-31
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Iqbal, Tanveer& Azhar, Muhammad Naeem& Ul Haq Bokhary, Syed Ahtsham. 2020. The K-Size Edge Metric Dimension of Graphs. Journal of Mathematics،Vol. 2020, no. 2020, pp.1-7.
https://search.emarefa.net/detail/BIM-1187969
Modern Language Association (MLA)
Iqbal, Tanveer…[et al.]. The K-Size Edge Metric Dimension of Graphs. Journal of Mathematics No. 2020 (2020), pp.1-7.
https://search.emarefa.net/detail/BIM-1187969
American Medical Association (AMA)
Iqbal, Tanveer& Azhar, Muhammad Naeem& Ul Haq Bokhary, Syed Ahtsham. The K-Size Edge Metric Dimension of Graphs. Journal of Mathematics. 2020. Vol. 2020, no. 2020, pp.1-7.
https://search.emarefa.net/detail/BIM-1187969
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1187969