Computing LF-Metric Dimension of Generalized Gear Networks

Hassan Zafar, Muhammad Javaid and Ebenezer Bonyah

Mathematical Problems in Engineering, 2021, vol. 2021, 1-8

Abstract:

The parameter of distance in the theory of networks plays a key role to study the different structural properties of the understudy networks or graphs such as symmetry, assortative, connectivity, and clustering. For the purpose, with the help of the parameter of distance, various types of metric dimensions have been defined to find the locations of machines (or robots) with respect to the minimum consumption of time, the shortest distance among the destinations, and the lesser number of utilized nodes as places of the objects. In this article, the latest derived form of metric dimension called as LF-metric dimension is studied, and various results for the generalized gear networks are obtained in the form of exact values and sharp bounds under certain conditions. The LF-metric dimension of some particular cases of generalized gear networks (called as generalized wheel networks) is also illustrated. Moreover, the bounded and unboundedness of the LF-metric dimension for all obtained results is also presented.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2021/4260975.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2021/4260975.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:jnlmpe:4260975

DOI: 10.1155/2021/4260975

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().