Abstract

The localisation of a network is the process of gaining access to a node's precise location or position. Using this technology, it is possible to determine the exact position of each network node in terms of a select few nodes within a subset. The locating set of a network is this subset, and the locating number of a network is its lowest cardinality. While the edge locating number is the same concept but on the bonds instead of nodes. In this work, we discussed some resolvability parameters such as locating number, edge locating number, fault-tolerant locating number and partition locating number of honeycomb rectangular torus. The honeycomb rectangular torus is very effective and innovative structure in chemical graph theory. This type of structure is being used in image processing, cellular phone base stations, computer graphics and more in mathematical chemistry.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.