IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v442y2023ics0096300322008050.html
   My bibliography  Save this article

Mixed metric dimension of some graphs

Author

Listed:
  • Nie, Kairui
  • Xu, Kexiang

Abstract

A vertex gv in a connected graph G is said to distinguish two distinct elements p,q∈V(G)⋃E(G) if dG(p,gv)≠dG(q,gv). A subset W⊆V(G) is a mixed metric generator of G if every two distinct elements from V(G)⋃E(G) are distinguished by W. The mixed metric dimension of G, denoted by βm(G), is the minimum cardinality of mixed metric generators in it. In this work, we first answer the problem of characterizing graphs G which achieve βm(G)=n−g(G)+3 in [Appl. Math. Comput. 314 (2017) 429–438] where g(G) is the girth of G, and then determine bounds on the mixed metric dimension of Cartesian product G□H which resolves two open problems in [Discrete Math. 341 (2018) 2083–2088] as a natural corollary. In addition, we provide two closed formulae for βm(T□Pn) in terms of βm(T) which generalize the result on βm(Ps□Pn) in [Appl. Math. Comput. 314 (2017) 429–438].

Suggested Citation

  • Nie, Kairui & Xu, Kexiang, 2023. "Mixed metric dimension of some graphs," Applied Mathematics and Computation, Elsevier, vol. 442(C).
  • Handle: RePEc:eee:apmaco:v:442:y:2023:i:c:s0096300322008050
    DOI: 10.1016/j.amc.2022.127737
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300322008050
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2022.127737?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Meiqin Wei & Jun Yue & Lily Chen, 2022. "The effect of vertex and edge deletion on the edge metric dimension of graphs," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 331-342, August.
    2. Wu, Jian & Wang, Li & Yang, Weihua, 2022. "Learning to compute the metric dimension of graphs," Applied Mathematics and Computation, Elsevier, vol. 432(C).
    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. 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. 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.
    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. 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.
    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. Sedlar, Jelena & Škrekovski, Riste, 2021. "Bounds on metric dimensions of graphs with edge disjoint cycles," Applied Mathematics and Computation, Elsevier, vol. 396(C).
    4. 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).
    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. 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.
    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:eee:apmaco:v:442:y:2023:i:c:s0096300322008050. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.