IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i4p869-d1062187.html
   My bibliography  Save this article

Metric Dimensions of Bicyclic Graphs

Author

Listed:
  • Asad Khan

    (School of Computer Science and Cyber Engineering, Guangzhou University, Guangzhou 510006, China
    These authors contributed equally to this work.)

  • Ghulam Haidar

    (Department of Mathematics and Statistics, The University of Haripur, Haripur 22620, Pakistan
    These authors contributed equally to this work.)

  • Naeem Abbas

    (Department of Mathematics and Statistics, The University of Haripur, Haripur 22620, Pakistan
    These authors contributed equally to this work.)

  • Murad Ul Islam Khan

    (Department of Mathematics and Statistics, The University of Haripur, Haripur 22620, Pakistan
    These authors contributed equally to this work.)

  • Azmat Ullah Khan Niazi

    (Department of Mathematics and Statistics, The University of Lahore, Sargodha 40100, Pakistan)

  • Asad Ul Islam Khan

    (Economics Department, Ibn Haldun University, Istanbul 34480, Turkey)

Abstract

The distance d ( v a , v b ) between two vertices of a simple connected graph G is the length of the shortest path between v a and v b . Vertices v a , v b of G are considered to be resolved by a vertex v if d ( v a , v ) ≠ d ( v b , v ) . An ordered set W = { v 1 , v 2 , v 3 , … , v s } ⊆ V ( G ) is said to be a resolving set for G , if for any v a , v b ∈ V ( G ) , ∃ v i ∈ W ∋ d ( v a , v i ) ≠ d ( v b , v i ) . The representation of vertex v with respect to W is denoted by r ( v | W ) and is an s -vector( s -tuple) ( d ( v , v 1 ) , d ( v , v 2 ) , d ( v , v 3 ) , … , d ( v , v s ) ) . Using representation r ( v | W ) , we can say that W is a resolving set if, for any two vertices v a , v b ∈ V ( G ) , we have r ( v a | W ) ≠ r ( v b | W ) . A minimal resolving set is termed a metric basis for G . The cardinality of the metric basis set is called the metric dimension of G , represented by d i m ( G ) . In this article, we study the metric dimension of two types of bicyclic graphs. The obtained results prove that they have constant metric dimension.

Suggested Citation

  • Asad Khan & Ghulam Haidar & Naeem Abbas & Murad Ul Islam Khan & Azmat Ullah Khan Niazi & Asad Ul Islam Khan, 2023. "Metric Dimensions of Bicyclic Graphs," Mathematics, MDPI, vol. 11(4), pages 1-17, February.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:4:p:869-:d:1062187
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/4/869/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/4/869/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Laxman Saha & Mithun Basak & Kalishankar Tiwary & Kinkar Chandra Das & Yilun Shang, 2022. "On the Characterization of a Minimal Resolving Set for Power of Paths," Mathematics, MDPI, vol. 10(14), pages 1-13, July.
    2. Sakander Hayat & Asad Khan & Yubin Zhong, 2022. "On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs," Mathematics, MDPI, vol. 10(11), pages 1-16, May.
    3. Sedlar, Jelena & Škrekovski, Riste, 2021. "Extremal mixed metric dimension with respect to the cyclomatic number," Applied Mathematics and Computation, Elsevier, vol. 404(C).
    4. Kelenc, Aleksander & Kuziak, Dorota & Taranenko, Andrej & G. Yero, Ismael, 2017. "Mixed metric dimension of graphs," Applied Mathematics and Computation, Elsevier, vol. 314(C), pages 429-438.
    5. Lihua You & Jieshan Yang & Yingxue Zhu & Zhifu You, 2014. "The Maximal Total Irregularity of Bicyclic Graphs," Journal of Applied Mathematics, Hindawi, vol. 2014, pages 1-9, April.
    6. Martin Knor & Jelena Sedlar & Riste Škrekovski, 2022. "Remarks on the Vertex and the Edge Metric Dimension of 2-Connected Graphs," Mathematics, MDPI, vol. 10(14), pages 1-16, July.
    7. Sedlar, Jelena & Škrekovski, Riste, 2021. "Bounds on metric dimensions of graphs with edge disjoint cycles," Applied Mathematics and Computation, Elsevier, vol. 396(C).
    8. Zehui Shao & S. M. Sheikholeslami & Pu Wu & Jia-Biao Liu, 2018. "The Metric Dimension of Some Generalized Petersen Graphs," Discrete Dynamics in Nature and Society, Hindawi, vol. 2018, pages 1-10, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sedlar, Jelena & Škrekovski, Riste, 2022. "Metric dimensions vs. cyclomatic number of graphs with minimum degree at least two," Applied Mathematics and Computation, Elsevier, vol. 427(C).
    2. Martin Knor & Jelena Sedlar & Riste Škrekovski, 2022. "Remarks on the Vertex and the Edge Metric Dimension of 2-Connected Graphs," Mathematics, MDPI, vol. 10(14), pages 1-16, July.
    3. Nie, Kairui & Xu, Kexiang, 2023. "Mixed metric dimension of some graphs," Applied Mathematics and Computation, Elsevier, vol. 442(C).
    4. Sakander Hayat & Asad Khan & Yubin Zhong, 2022. "On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs," Mathematics, MDPI, vol. 10(11), pages 1-16, May.
    5. Sedlar, Jelena & Škrekovski, Riste, 2021. "Extremal mixed metric dimension with respect to the cyclomatic number," Applied Mathematics and Computation, Elsevier, vol. 404(C).
    6. Enqiang Zhu & Shaoxiang Peng & Chanjuan Liu, 2022. "Identifying the Exact Value of the Metric Dimension and Edge Dimension of Unicyclic Graphs," Mathematics, MDPI, vol. 10(19), pages 1-14, September.
    7. David G. L. Wang & Monica M. Y. Wang & Shiqiang Zhang, 2022. "Determining the edge metric dimension of the generalized Petersen graph P(n, 3)," Journal of Combinatorial Optimization, Springer, vol. 43(2), pages 460-496, March.
    8. Yousaf, Shamaila & Bhatti, Akhlaq Ahmad & Ali, Akbar, 2022. "On total irregularity index of trees with given number of segments or branching vertices," Chaos, Solitons & Fractals, Elsevier, vol. 157(C).
    9. Laxman Saha & Rupen Lama & Bapan Das & Avishek Adhikari & Kinkar Chandra Das, 2023. "Optimal Fault-Tolerant Resolving Set of Power Paths," Mathematics, MDPI, vol. 11(13), pages 1-18, June.
    10. Sedlar, Jelena & Škrekovski, Riste, 2021. "Bounds on metric dimensions of graphs with edge disjoint cycles," Applied Mathematics and Computation, Elsevier, vol. 396(C).
    11. Ashrafi, Ali Reza & Ghalavand, Ali, 2020. "Note on non-regular graphs with minimal total irregularity," Applied Mathematics and Computation, Elsevier, vol. 369(C).
    12. Juan Wang & Lianying Miao & Yunlong Liu, 2019. "Characterization of n -Vertex Graphs of Metric Dimension n − 3 by Metric Matrix," Mathematics, MDPI, vol. 7(5), pages 1-13, May.
    13. Dorota Kuziak, 2020. "The Strong Resolving Graph and the Strong Metric Dimension of Cactus Graphs," Mathematics, MDPI, vol. 8(8), pages 1-14, August.
    14. Rashad Ismail & Asim Nadeem & Kamran Azhar, 2024. "Local Metric Resolvability of Generalized Petersen Graphs," Mathematics, MDPI, vol. 12(14), pages 1-14, July.
    15. Laxman Saha & Bapan Das & Kalishankar Tiwary & Kinkar Chandra Das & Yilun Shang, 2023. "Optimal Multi-Level Fault-Tolerant Resolving Sets of Circulant Graph C ( n : 1, 2)," Mathematics, MDPI, vol. 11(8), pages 1-16, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:4:p:869-:d:1062187. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.