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

Metric-locating-dominating sets of graphs for constructing related subsets of vertices

Author

Listed:
  • González, Antonio
  • Hernando, Carmen
  • Mora, Mercè

Abstract

A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distances from the elements of S, and the minimum cardinality of such a set is called the metric-location-domination number. In this paper, we undertake a study that, in general graphs and specific families, relates metric-locating-dominating sets to other special sets: resolving sets, dominating sets, locating-dominating sets and doubly resolving sets. We first characterize the extremal trees of the bounds that naturally involve metric-location-domination number, metric dimension and domination number. Then, we prove that there is no polynomial upper bound on the location-domination number in terms of the metric-location-domination number, thus extending a result of Henning and Oellermann. Finally, we show different methods to transform metric-locating-dominating sets into locating-dominating sets and doubly resolving sets. Our methods produce new bounds on the minimum cardinalities of all those sets, some of them concerning parameters that have not been related so far.

Suggested Citation

  • González, Antonio & Hernando, Carmen & Mora, Mercè, 2018. "Metric-locating-dominating sets of graphs for constructing related subsets of vertices," Applied Mathematics and Computation, Elsevier, vol. 332(C), pages 449-456.
    • Handle: RePEc:eee:apmaco:v:332:y:2018:i:c:p:449-456
    DOI: 10.1016/j.amc.2018.03.053
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318302261
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.03.053?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. András Sebő & Eric Tannier, 2004. "On Metric Generators of Graphs," Mathematics of Operations Research, INFORMS, vol. 29(2), pages 383-393, May.
    2. Mladenović, Nenad & Kratica, Jozef & Kovačević-Vujčić, Vera & Čangalović, Mirjana, 2012. "Variable neighborhood search for metric dimension and minimal doubly resolving set problems," European Journal of Operational Research, Elsevier, vol. 220(2), pages 328-337.
    3. Stephen, Sudeep & Rajan, Bharati & Grigorious, Cyriac & William, Albert, 2015. "Resolving-power dominating sets," Applied Mathematics and Computation, Elsevier, vol. 256(C), pages 778-785.
    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. Michael Hallaway & Cong X. Kang & Eunjeong Yi, 2014. "On metric dimension of permutation graphs," Journal of Combinatorial Optimization, Springer, vol. 28(4), pages 814-826, November.
    2. Ismael González Yero, 2020. "The Simultaneous Strong Resolving Graph and the Simultaneous Strong Metric Dimension of Graph Families," Mathematics, MDPI, vol. 8(1), pages 1-11, January.
    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. 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).
    5. Mladenović, Nenad & Kratica, Jozef & Kovačević-Vujčić, Vera & Čangalović, Mirjana, 2012. "Variable neighborhood search for metric dimension and minimal doubly resolving set problems," European Journal of Operational Research, Elsevier, vol. 220(2), pages 328-337.
    6. Sedlar, Jelena & Škrekovski, Riste, 2021. "Extremal mixed metric dimension with respect to the cyclomatic number," Applied Mathematics and Computation, Elsevier, vol. 404(C).
    7. 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.
    8. Yero, Ismael G. & Estrada-Moreno, Alejandro & Rodríguez-Velázquez, Juan A., 2017. "Computing the k-metric dimension of graphs," Applied Mathematics and Computation, Elsevier, vol. 300(C), pages 60-69.
    9. Sunny Kumar Sharma & Vijay Kumar Bhat, 2022. "On metric dimension of plane graphs with $$\frac{m}{2}$$ m 2 number of 10 sided faces," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1433-1458, October.
    10. Xiao, Yiyong & Zhang, Renqian & Zhao, Qiuhong & Kaku, Ikou & Xu, Yuchun, 2014. "A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems," European Journal of Operational Research, Elsevier, vol. 235(1), pages 102-114.
    11. Jun Guo & Kaishun Wang & Fenggao Li, 2013. "Metric dimension of some distance-regular graphs," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 190-197, July.
    12. Muhammad Azeem & Muhammad Kamran Jamil & Yilun Shang, 2023. "Notes on the Localization of Generalized Hexagonal Cellular Networks," Mathematics, MDPI, vol. 11(4), pages 1-15, February.
    13. Ron Adar & Leah Epstein, 2017. "The k-metric dimension," Journal of Combinatorial Optimization, Springer, vol. 34(1), pages 1-30, July.
    14. Iztok Peterin & Gabriel Semanišin, 2021. "On the Maximal Shortest Paths Cover Number," Mathematics, MDPI, vol. 9(14), pages 1-10, July.
    15. 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.
    16. Rashad Ismail & Asim Nadeem & Kamran Azhar, 2024. "Local Metric Resolvability of Generalized Petersen Graphs," Mathematics, MDPI, vol. 12(14), pages 1-14, July.
    17. Shahid Imran & Muhammad Kamran Siddiqui & Muhammad Imran & Muhammad Hussain, 2018. "On Metric Dimensions of Symmetric Graphs Obtained by Rooted Product," Mathematics, MDPI, vol. 6(10), pages 1-16, October.
    18. 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:332:y:2018:i:c:p:449-456. 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.