The K-Size Edge Metric Dimension of Graphs
Autor: | Tanveer Iqbal, Muhammad Naeem Azhar, Syed Ahtsham Ul Haq Bokhary |
---|---|
Jazyk: | angličtina |
Rok vydání: | 2020 |
Předmět: | |
Zdroj: | Journal of Mathematics, Vol 2020 (2020) |
Druh dokumentu: | article |
ISSN: | 2314-4629 2314-4785 |
DOI: | 10.1155/2020/1023175 |
Popis: | 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. |
Databáze: | Directory of Open Access Journals |
Externí odkaz: |