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

Distance-based vertex identification in graphs: The outer multiset dimension

Author

Listed:
  • Gil-Pons, Reynaldo
  • Ramírez-Cruz, Yunior
  • Trujillo-Rasua, Rolando
  • Yero, Ismael G.

Abstract

The characterisation of vertices in a network, in relation to other peers, has been used as a primitive in many computational procedures, such as node localisation and (de-)anonymisation. This article focuses on a characterisation type known as the multiset metric representation. Formally, given a graph G and a subset of vertices S={w1,…,wt}⊆V(G), the multiset representationof a vertex u ∈ V(G) with respect to S is the multiset m(u|S)={|dG(u,w1),…,dG(u,wt)|}. A subset of vertices S such that m(u|S)=m(v|S)⇔u=v for every u, v ∈ V(G)∖S is said to be a multiset resolving set, and the cardinality of the smallest such set is the outer multiset dimension. We study the general behaviour of the outer multiset dimension, and determine its exact value for several graph families. We also show that computing the outer multiset dimension of arbitrary graphs is NP-hard, and provide methods for efficiently handling particular cases.

Suggested Citation

  • Gil-Pons, Reynaldo & Ramírez-Cruz, Yunior & Trujillo-Rasua, Rolando & Yero, Ismael G., 2019. "Distance-based vertex identification in graphs: The outer multiset dimension," Applied Mathematics and Computation, Elsevier, vol. 363(C), pages 1-1.
    • Handle: RePEc:eee:apmaco:v:363:y:2019:i:c:40
    DOI: 10.1016/j.amc.2019.124612
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300319306046
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2019.124612?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.

    Citations

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


    Cited by:

    1. Dorota Kuziak, 2020. "The Strong Resolving Graph and the Strong Metric Dimension of Cactus Graphs," Mathematics, MDPI, vol. 8(8), pages 1-14, August.

    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:363:y:2019:i:c:40. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.