The Multiresolving Sets of Graphs with Prescribed Multisimilar Equivalence Classes

Varanoot Khemmani and Supachoke Isariyapalakul

International Journal of Mathematics and Mathematical Sciences, 2018, vol. 2018, 1-6

Abstract:

For a set of vertices and a vertex of a connected graph , the multirepresentation of with respect to is the -multiset where is the distance between the vertices and for . The set is a multiresolving set of if every two distinct vertices of have distinct multirepresentations with respect to . The minimum cardinality of a multiresolving set of is the multidimension of . It is shown that, for every pair of integers with and , there is a connected graph of order with . For a multiset and an integer , we define . A multisimilar equivalence relation on with respect to is defined by if for some integer . We study the relationship between the elements in multirepresentations of vertices that belong to the same multisimilar equivalence class and also establish the upper bound for the cardinality of a multisimilar equivalence class. Moreover, a multiresolving set with prescribed multisimilar equivalence classes is presented.

Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2018/8978193.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2018/8978193.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:8978193

DOI: 10.1155/2018/8978193

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().