Computation of Resolvability Parameters for Benzenoid Hammer Graph

Ali Ahmad, Al-Nashri Al-Hossain Ahmad and Gohar Ali

Journal of Mathematics, 2022, vol. 2022, 1-11

Abstract: A representation of each vertex of a network into distance-based arbitrary tuple form, adding the condition of uniqueness of each vertex with reference to some settled vertices. Such settled vertices form a set known as resolving set. This idea was delivered in various problems of computer networking as well as in chemical graph theory. Due to its huge implications, many new variants were introduced such as edge resolving set, fault-tolerant version of edge, and vertex resolving set and its generalization named as partition resolving set. In this work, we addressed all these variants for a benzenoid chemical structure named a hammer graph. Moreover, we proved that all the above variants are independent of the size and order of this graph.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2022/7013832.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2022/7013832.xml (application/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:jjmath:7013832

DOI: 10.1155/2022/7013832

Access Statistics for this article

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