Results 41 to 50 of about 654,066 (314)
Edge Metric and Fault-Tolerant Edge Metric Dimension of Hollow Coronoid
Geometric arrangements of hexagons into six sides of benzenoids are known as coronoid systems. They are organic chemical structures by definition. Hollow coronoids are divided into two types: primitive and catacondensed coronoids.
Ali N. A. Koam+3 more
doaj +1 more source
On a Metric that Characterizes Dimension [PDF]
Sometimes it is possible to characterize topological properties of a metrizable space M by claiming that a certain (topologypreserving) metric ρ can be introduced in M.
openaire +3 more sources
Metric Dimensions Of Graphs [PDF]
In this article, some kinds of triple belongs to metric dimensions are defined. Some classes of graphs in the matter of these kinds, are studied and the relation amid these kinds are considered. The kind of having equivalency amid these notions and some classes of graphs, is obtained.
openaire +2 more sources
On the metric dimension of Grassmann graphs [PDF]
special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity The metric dimension of a graph Gamma is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex.
Karen Meagher, Robert F. Bailey
openaire +5 more sources
On the metric dimensions for sets of vertices
21 pages, 5 ...
Hakanen, Anni+3 more
openaire +5 more sources
Metric dimension of metric transform and wreath product
Let $(X,d)$ be a metric space. A non-empty subset $A$ of the set $X$ is called resolving set of the metric space $(X,d)$ if for two arbitrary not equal points $u,v$ from $X$ there exists an element $a$ from $A$, such that $d(u,a) \neq d(v,a)$.
B.S. Ponomarchuk
doaj +1 more source
On Adjacency Metric Dimension of Some Families of Graph
Metric dimension of a graph is a well-studied concept. Recently, adjacency metric dimension of graph has been introduced. A set Qa⊂VG is considered to be an adjacency metric generator for G if u1,u2∈V\Qa (supposing each pair); there must exist a vertex q∈
Ali N. A. Koam+4 more
doaj +1 more source
On the Dominant Local Resolving Set of Vertex Amalgamation Graphs
Basically, the new topic of the dominant local metric dimension which be symbolized by Ddim_l (H) is a combination of two concepts in graph theory, they were called the local metric dimension and dominating set. There are some terms in this topic that is
Reni Umilasari+3 more
doaj +1 more source
Abstract Resolving sets are designed to locate an object in a network by measuring the distances to the object. However, if there are more than one object present in the network, this can lead to wrong conclusions. To overcome this problem, we introduce the concept of solid-resolving sets.
Anni Hakanen+2 more
openaire +2 more sources
Metric based resolvability of cycle related graphs
If a subset of vertices of a graph, designed in such a way that the remaining vertices have unique identification (usually called representations) with respect to the selected subset, then this subset is named as a metric basis (or resolving set).
Ali N. A. Koam
doaj +1 more source