Edge Resolvability in Generalized Petersen Graphs-Reference-Cited by-同舟云学术

Edge Resolvability in Generalized Petersen Graphs

Published:2023-08-24 Issue:9 Volume:15 Page:1633
ISSN:2073-8994
Container-title:Symmetry
language:en
Short-container-title:Symmetry

Author:

Iqbal Tanveer¹,Bokhary Syed Ahtsham Ul Haq²^ORCID,Hilali Shreefa O.³,Alhagyan Mohammed⁴,Gargouri Ameni⁴,Azhar Muhammad Naeem⁵

Affiliation:

1. Department of Mathematics, Emerson University, Multan 60700, Pakistan

2. Centre of Advanced Studies in Pure and Applied Mathematics, Bahauddin Zakariya University, Multan 60700, Pakistan

3. Department of Mathematics, College of Sciences and Arts (Majardah), King Khalid University, Magardah 61937, Saudi Arabia

4. Department of Mathematics, College of Humanities and Science in Al Aflaj, Prince Sattam Bin Abdulaziz University, Riyadh 11912, Saudi Arabia

5. Bhawalnagar Campus, The Islamia University of Bhawalpur, Bahawalnagar 62300, Pakistan

Abstract

The generalized Petersen graphs are a type of cubic graph formed by connecting the vertices of a regular polygon to the corresponding vertices of a star polygon. This graph has many interesting graph properties. As a result, it has been widely researched. In this work, the edge metric dimensions of the generalized Petersen graphs GP(2l + 1, l) and GP(2l, l) are explored, and it is shown that the edge metric dimension of GP(2l + 1, l) is equal to its metric dimension. Furthermore, it is proved that the upper bound of the edge metric dimension is the same as the value of the metric dimension for the graph GP(2l, l).

Funder

King Khalid University

Prince Sattam bin Abdulaziz University

Publisher

MDPI AG

Subject

Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)

Link

https://www.mdpi.com/2073-8994/15/9/1633/pdf

Reference24 articles.

1. Uniquely identifying the edges of a graph: The edge metric dimension;Kelenc;Discret. Appl. Math.,2018

2. Landmarks in graphs;Khuller;Discret. Appl. Math.,1996

3. Resolvability in graphs and the metric dimension of a graph;Chartrand;Discret. Appl. Math.,2000

4. Resolvability and the upper dimension of graphs;Chartrand;Comput. Math. Appl.,2000

5. Structure-activity maps for visualizing the graph variables arising in drug design;Johnson;J. Biopharm. Stat.,1993