Results 41 to 50 of about 2,320,114 (270)
On the Edge Metric Dimension of Different Families of Möbius Networks [PDF]
For an ordered subset Q e of vertices in a simple connected graph
Bo Deng +2 more
openaire +1 more source
Patched Network and Its Vertex-Edge Metric-Based Dimension
The p-type networks are designed with the help of CVNET at topo group Cluj and also given support by nano studio. Such networks develop new p-type surfaces and also represent the decorations of the surfaces.
Sidra Bukhari +3 more
doaj +1 more source
On the edge metric dimension of graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meiqin Wei, Jun Yue, Xiaoyu zhu
openaire +3 more sources
Edge Metric Dimension and Edge Basis of One-Heptagonal Carbon Nanocone Networks
A molecular (chemical) graph is a simple connected graph, where the vertices represent the compound’s atoms and the edges represent bonds between the atoms, and the degree (valence) of every vertex (atom) is not more than four.
Karnika Sharma +2 more
doaj +1 more source
Bounds on metric dimensions of graphs with edge disjoint cycles [PDF]
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 vertex
Jelena Sedlar, Riste Skrekovski
openaire +3 more sources
Mixed metric dimension of graphs with edge disjoint cycles [PDF]
In a graph G, the cardinality of the smallest ordered set of vertices that distinguishes every element of V (G)[E(G) is called the mixed metric dimension of G. In this paper we first establish the exact value of the mixed metric dimension of a unicycic graph G which is derived from the structure of G.
Jelena Sedlar, Riste Skrekovski
openaire +5 more sources
PROPERTIES OF CERTAIN CONNECTED GRAPHS RELATED TO THEIR EDGE METRIC DIMENSION [PDF]
Metric dimension, resolving sets and edge metric dimension are very important invariants for the resolvability of graphs that have been studied and investigated intensively in the literature over the last decades.
Bisharat, Sanabel Mahmoud Y.
core
Edge metric dimension of $k$ multiwheel graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bataineh, Mohammad S. +2 more
openaire +2 more sources
Computing the Mixed Metric Dimension of a Generalized Petersen Graph P(n, 2)
Let Γ = (V, E) be a connected graph. A vertex i ∈ V recognizes two elements (vertices or edges) j, k ∈ E ∩ V, if dΓ(i, j) ≠ dΓ(i, k). A set S of vertices in a connected graph Γ is a mixed metric generator for Γ if every two distinct elements (vertices or
Hassan Raza, Ying Ji
doaj +1 more source
On Resolvability Parameters of Some Wheel-Related Graphs
Let G=V,E be a simple connected graph, w∈V be a vertex, and e=uv∈E be an edge. The distance between the vertex w and edge e is given by de,w=mindw,u,dw,v, A vertex w distinguishes two edges e1, e2∈E if dw,e1≠dw,e2.
Bin Yang +3 more
doaj +1 more source

