Web10 de mai. de 2024 · arXivLabs: experimental projects with community collaborators. arXivLabs is a framework that allows collaborators to develop and share new arXiv … WebF. Harary and R. A. Melter, “On the Metric Dimension of a Graph,” Ars Combinatoria, Vol. 2, 1976, pp. 191-195. has been cited by the following article: TITLE: On Cycle Related Graphs with Constant Metric Dimension AUTHORS: Murtaza Ali, Gohar Ali, Usman Ali, M. T. Rahim KEYWORDS: Metric Dimension; Basis; Resolving Set; Dragon Graph
The Metric Dimension of the Total Graph of a Finite ... - Cambridge
WebIn this article, we propose a new multi-metric graph-fusion method, based on the Flexible Manifold Embedding algorithm. Our proposed method represents a unified framework that merges two phases: graph fusion and LP. Based on one available view, different simple graphs were efficiently generated and used as input to our proposed fusion approach. Web10 de mai. de 2024 · Strong metric dimension of generalized Jahangir graph Rashid Farooq, Naila Mehreen Let be a simple and connected graph with vertex set . A vertex strongly resolves two vertices if belongs to a shortest path or belongs to a shortest path. A set is a strong resolving set for if every pair of vertices of is strongly resolved by some … solichamba
Fractional Metric Dimension of Generalized Jahangir Graph
WebMetric dimension is a distance-based tool that is used in the different fields of computer science and chemistry such as navigation, combinatorial optimization, pattern recognition, image processing, integer programming and formation of chemical compounds. Web1 de out. de 2016 · On the metric dimension of the Jahangir graph. Bull. Math. Soc. Sci. Math. Roumanie, 50 (98), No.4: 371–376 (2007) MathSciNet MATH Google Scholar Download references Authors and Affiliations Department of Mathematics, School of Natural Sciences, National University of Sciences and Technology, Sector H-12, Islamabad, … WebThe size of a dominant edge metric basis of G is denoted by Ddime(G) and is called the dominant edge metric dimension. In this paper, the concept of dominant edge metric dimension (DEMD for short) is introduced and its basic properties are studied. Moreover, NP-hardness of computing DEMD of connected graphs is proved. solich consulting