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

Remarks on the Vertex and the Edge Metric Dimension of 2-Connected Graphs

Author

Listed:
  • Martin Knor

    (Faculty of Civil Engineering, Slovak University of Technology in Bratislava, Radlinského 11, 813 68 Bratislava, Slovakia
    These authors contributed equally to this work.)

  • Jelena Sedlar

    (Faculty of Civil Engineering, Architecture and Geodesy, University of Split, 21000 Split, Croatia
    Faculty of Information Studies, 8000 Novo Mesto, Slovenia
    These authors contributed equally to this work.)

  • Riste Škrekovski

    (Faculty of Information Studies, 8000 Novo Mesto, Slovenia
    Faculty of Mathematics and Physics, University of Ljubljana, 1000 Ljubljana, Slovenia
    These authors contributed equally to this work.)

Abstract

The vertex (respectively edge) metric dimension of a graph G is the size of a smallest vertex set in G , which distinguishes all pairs of vertices (respectively edges) in G , and it is denoted by dim ( G ) (respectively edim ( G ) ). The upper bounds dim ( G ) ≤ 2 c ( G ) − 1 and edim ( G ) ≤ 2 c ( G ) − 1 , where c ( G ) denotes the cyclomatic number of G , were established to hold for cacti without leaves distinct from cycles, and moreover, all leafless cacti that attain the bounds were characterized. It was further conjectured that the same bounds hold for general connected graphs without leaves, and this conjecture was supported by showing that the problem reduces to 2-connected graphs. In this paper, we focus on Θ -graphs, as the most simple 2-connected graphs distinct from the cycle, and show that the the upper bound 2 c ( G ) − 1 holds for both metric dimensions of Θ -graphs; we characterize all Θ -graphs for which the bound is attained. We conclude by conjecturing that there are no other extremal graphs for the bound 2 c ( G ) − 1 in the class of leafless graphs besides already known extremal cacti and extremal Θ -graphs mentioned here.

Suggested Citation

  • 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.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:14:p:2411-:d:859602
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/14/2411/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/14/2411/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Sedlar, Jelena & Škrekovski, Riste, 2021. "Extremal mixed metric dimension with respect to the cyclomatic number," Applied Mathematics and Computation, Elsevier, vol. 404(C).
    2. 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.
    3. 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).
    4. Yuezhong Zhang & Suogang Gao, 2020. "On the edge metric dimension of convex polytopes and its related graphs," Journal of Combinatorial Optimization, Springer, vol. 39(2), pages 334-350, February.
    5. Sedlar, Jelena & Škrekovski, Riste, 2021. "Bounds on metric dimensions of graphs with edge disjoint cycles," Applied Mathematics and Computation, Elsevier, vol. 396(C).
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. 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).
    3. 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.

    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. Nie, Kairui & Xu, Kexiang, 2023. "Mixed metric dimension of some graphs," Applied Mathematics and Computation, Elsevier, vol. 442(C).
    3. 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.
    4. Sedlar, Jelena & Škrekovski, Riste, 2021. "Extremal mixed metric dimension with respect to the cyclomatic number," Applied Mathematics and Computation, Elsevier, vol. 404(C).
    5. 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.
    6. Sedlar, Jelena & Škrekovski, Riste, 2021. "Bounds on metric dimensions of graphs with edge disjoint cycles," Applied Mathematics and Computation, Elsevier, vol. 396(C).
    7. 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.
    8. 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.
    9. Knor, Martin & Majstorović, Snježana & Masa Toshi, Aoden Teo & Škrekovski, Riste & Yero, Ismael G., 2021. "Graphs with the edge metric dimension smaller than the metric dimension," Applied Mathematics and Computation, Elsevier, vol. 401(C).
    10. Hassan Raza, 2021. "Computing Open Locating-Dominating Number of Some Rotationally-Symmetric Graphs," Mathematics, MDPI, vol. 9(12), pages 1-12, June.
    11. 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.
    12. Dorota Kuziak, 2020. "The Strong Resolving Graph and the Strong Metric Dimension of Cactus Graphs," Mathematics, MDPI, vol. 8(8), pages 1-14, August.
    13. Rashad Ismail & Asim Nadeem & Kamran Azhar, 2024. "Local Metric Resolvability of Generalized Petersen Graphs," Mathematics, MDPI, vol. 12(14), pages 1-14, July.
    14. Ali N. A. Koam & Ali Ahmad & Muhammad Ibrahim & Muhammad Azeem, 2021. "Edge Metric and Fault-Tolerant Edge Metric Dimension of Hollow Coronoid," Mathematics, MDPI, vol. 9(12), pages 1-14, June.

    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:10:y:2022:i:14:p:2411-:d:859602. 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.