On the edge metric dimension of graphs
Web1 de abr. de 2013 · In graph theory, metric dimension is a parameter that has appeared in various applications, as diverse as network discovery and verification [2], strategies for … WebThe concept of metric dimension is widely applied to solve various problems in the different fields of computer science and chemistry, such as computer networking, integer …
On the edge metric dimension of graphs
Did you know?
Web31 de mar. de 2024 · An edge metric basis of G is an edge metric generator of G of cardinality dim e ( G). It is trivial to see that for any connected graph G of order n the following holds: 1 ≤ dim e ( G) ≤ n − 1. Graphs for which dim e ( G) = n − 1 are called topful. An edge metric generator S is not necessarily a metric generator. Web21 de out. de 2024 · The metric dimension (MD) of a graph is a combinatorial notion capturing the minimum number of landmark nodes needed to distinguish every pair of nodes in the graph based on graph distance. We study how much the MD can increase if we add a single edge to the graph. The extra edge can either be selected adversarially, in which …
Web14 de dez. de 2015 · The concept of k-metric generator was introduced by the authors of this paper in [] as a generalization of the standard concept of metric generator.In graph theory, the notion of metric generator was previously given by Slater in [19, 20], where the metric generators were called locating sets, and also, independently by Harary and … 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. Furthermore, this ...
Webwww.ejgta.org Electronic Journal of Graph Theory and Applications 11 (1) (2024), 197–208 The dominant edge metric dimension of graphs Mostafa Tavakolia, Meysam Korivand b, Ahmad Erfanian ... Web31 de jan. de 2016 · We prove that computing the edge metric dimension of connected graphs is NP-hard and give some approximation results. Moreover, we present some …
Web17 de mar. de 2024 · The edge metric dimension e d i m ( G) of a graph G is the least size of an edge metric generator of G. In this paper, we give the characterization of all connected bipartite graphs with e d i m = n − 2, which partially answers an open problem of …
WebThe size of a dominant edge metric basis of G is denoted by D d i m e ( 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. faz fotoWeb1 de mar. de 2024 · In this paper, we examined complement metric dimension of particular tree graphs such as caterpillar graph (C mn ), firecrackers graph (Fmn), and banana … fazfoxWebThe 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 … honda ra273 engineWebThe size of a dominant edge metric basis of G is denoted by D d i m e ( G ) and is called the dominant edge metric dimension. In this paper, the concept of dominant edge … honda racing lanyardWeb19 de dez. de 2024 · ABSTRACT. In this paper, we construct the new concept namely the complement edge metric dimension on the graph, which is the result of combining two concepts. The first concept is edge metric dimension and in the second concept is complement metric dimension. Let given a graph G = ( V ( G ), E ( G )) where V ( G) = … honda rabbit 1000cc mudahWeb6 de ago. de 2024 · Analogous to resolving function and fractional metric dimension, we introduce edge resolving function and fractional edge (metric) dimension as follows. A … honda ra302 engineWeb1 de mar. de 2024 · The G be a connected graph with vertex set V (G) and edge set E (G).A subset S ⊆ V (G) is called a dominating set of G if for every vertex x in V (G) ∖ S, there exists at least one vertex u in S such that x is adjacent to u.An ordered set W ⊆ V (G) is called a resolving set of G, if every pair of vertices u and v in V (G) have distinct … faz fraport