On the edge metric dimension of graphs
Web10 de abr. de 2024 · Signal Variation Metrics and Graph Fourier Transforms for Directed Graphs. Laura Shimabukuro, Antonio Ortega. Published 10 April 2024. Mathematics, Computer Science. In this paper we consider the problem of constructing graph Fourier transforms (GFTs) for directed graphs (digraphs), with a focus on developing multiple … Web11 de nov. de 2024 · We also computed the fault-tolerant edge metric dimension of path, cycle, complete graph, cycle with chord graph, tadpole graph and kayak paddle graph. Home {{subColumn.name}} AIMS Mathematics. Search ... Uniquely identifying the edges of a graph: The edge metric dimension, Discrete Appl. Math., 251 (2024), 204-220. doi: …
On the edge metric dimension of graphs
Did you know?
Web31 de dez. de 2024 · Furthermore, the k-size edge metric dimension of the graphs Pm Pn, Pm Cn for m, n ≥ 3 and the generalized Petersen graph is determined. It is shown that these families of graphs have constant k ... Web1 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 …
Web1 de jan. de 2024 · The edge metric dimension of a graph is introduced based on the distance of edges of the graph. As a main result we computed edge metric dimension … WebThe metric dimension dim(G) of a graph G is the minimum cardinality of a set of vertices such that every vertex of G is uniquely determined by its vector of distances to the chosen vertices. Let v and e respectively denote a vertex and an edge of a graph G. We show that, for any integer k, there exists a graph G such that dim(G − v) − dim(G) = k.
Web1 de ago. de 2024 · Knor M, Majstorović S, Toshi A, S̆krekovski R, Yero I (2024) Graphs with the edge metric dimension smaller than the metric dimension. Appl Math Comput … Web4 de out. de 2024 · The edge metric dimension problem was recently introduced, which initiated the study of its mathematical properties. The theoretical properties of the edge …
Web20 de out. de 2024 · In a graph G, cardinality of the smallest ordered set of vertices that distinguishes every element of V (G) is the (vertex) metric dimension of G. Similarly, the cardinality of such a set is the edge metric dimension of G, if it distinguishes E(G). In this paper these invariants are considered first for unicyclic graphs, and it is shown that the …
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 … phone number direct lineWeb31 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 … phone number direct tv cancellationWeb1 de jun. de 2024 · As a natural counterpart, Kelenc et al. [9] introduced the concept of edge metric dimension and proved that the decision problem of computing the edge metric … how do you pronounce lycanthropeWeb8 de abr. 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 … phone number digits ukWebThe 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. phone number digits to lettersWeb1 de jul. de 2024 · Given a connected graph G ( V , E ), the edge dimension, denoted edim ( G ), is the least size of a set S ⊆ V that distinguishes every pair of edges of G, in the … how do you pronounce lymphedemaWeb1 de mai. de 2024 · The local edge metric dimension of G, denoted by dim E (G), is a local edge metric generator of G if for every pair xk,ky of adjacent edges of G. Our … phone number direct tv billing