Results 41 to 50 of about 888,398 (240)
Metric Dimension of Maximal Outerplanar Graphs [PDF]
Bulletin of the Malaysian Mathematical Sciences Society, 2021 25 pages, 16 ...
M. Claverol +6 more
openaire +5 more sources
Strong metric dimension: A survey [PDF]
Yugoslav Journal of Operations Research, 2014 The strong metric dimension has been a subject of considerable amount of research in recent years. This survey describes the related development by bringing together theoretical results and computational approaches, and places the recent results
Kratica Jozef +3 more
doaj +1 more source
Metric Dimension Threshold of Graphs
Journal of Mathematics, 2022 Let G be a connected graph. A subset S of vertices of G is said to be a resolving set of G, if for any two vertices u and v of G there is at least a member w of S such that du,w≠dv,w.
Meysam Korivand +2 more
doaj +1 more source
On the Dominant Local Resolving Set of Vertex Amalgamation Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 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
Dimension of metric spaces [PDF]
Fundamenta Mathematicae, 1956 It is to be shown that a metric space has dimension ≤ n if and only if there exists a sequence {{ai} of locally finite open coverings, each of order ≤ n, with mesh tending to zero as i→∞, such that (a) the closure of each member of ai+1 is contained in some member of ai+1 is contained in some member of ai.
Witold Hurewicz, C. H. Dowker
openaire +2 more sources
On the metric dimension of Grassmann graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 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 variational principles of metric mean dimension on subset in Feldman-Katok metric [PDF]
arXiv, 2022 In this paper, we studied the metric mean dimension in Feldman-Katok(FK for short) metric. We introduced the notions of FK-Bowen metric mean dimension and FK-Packing metric mean dimension on subset. And we established two variational principles.
arxiv
Theoretical Computer Science, 2020 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 mean dimension and analog compression
, 2020 Wu and Verd\'u developed a theory of almost lossless analog compression, where one imposes various regularity conditions on the compressor and the decompressor with the input signal being modelled by a (typically infinite-entropy) stationary stochastic ...
Gutman, Yonatan, Śpiewak, Adam
core +1 more source
On asymptotic dimension of countable abelian groups [PDF]
, 2005 We compute the asymptotic dimension of the rationals given with an invariant proper metric. Also, we show that a countable torsion abelian group taken with an invariant proper metric has asymptotic dimension zero.Comment: 9 pages, 1 figure ...
Smith, J.
core +2 more sources