Results 1 to 10 of about 60,505 (275)
Resolving sets for higher dimensional projective spaces [PDF]
Finite Fields and Their Applications, 2020 In this paper, the authors continue the study the metric dimension of certain incidence graphs, started in [\textit{T. Héger} et al., Australas. J. Comb. 78, Part 3, 352--375 (2020; Zbl 1453.05027); \textit{T. Héger} and \textit{M. Takáts}, Electron. J. Comb. 19, No. 4, Research Paper P30, 21 p. (2012; Zbl 1266.05020)].
Bartoli, Daniele +3 more
core +5 more sources
Coloring Cantor sets and resolvability of pseudocompact spaces [PDF]
Commentationes Mathematicae Universitatis Carolinae, 2019 8 ...
Juhász, István +2 more
openaire +3 more sources
Certain Domination Parameters and Their Resolving Versions of Fractal Cubic Networks
Fractal and FractionalNetworks are designed to communicate, operate, and allocate tasks to respective commodities. Operating supercomputers became challenging, which was handled by the network design commonly known as hypercube, denoted by Qn. In a recent study, the hypercube
Savari Prabhu +2 more
doaj +1 more source
Conditional resolvability in graphs: a survey
International Journal of Mathematics and Mathematical Sciences, 2004 For an ordered set W={w1,w2,…,wk} of vertices and a vertex v in a connected graph G, the code of v with respect to W is the k-vector cW(v)=(d(v,w1),d(v,w2),…,d(v,wk)), where d(x,y) represents the distance between the vertices x and y.
Varaporn Saenpholphat, Ping Zhang
doaj +1 more source
Overlarge sets of resolvable idempotent quasigroups
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Y. Chang +3 more
openaire +2 more sources
The Vertex-Edge Resolvability of Some Wheel-Related Graphs
Journal of Mathematics, 2021 A vertex w∈VH distinguishes (or resolves) two elements (edges or vertices) a,z∈VH∪EH if dw,a≠dw,z. A set Wm of vertices in a nontrivial connected graph H is said to be a mixed resolving set for H if every two different elements (edges and vertices) of H ...
Bao-Hua Xing +4 more
doaj +1 more source
A CHARACTERIZATION OF LOCAL RESOLVENT SETS [PDF]
Communications of the Korean Mathematical Society, 2006 Let T be a bounded linear operator on a Banach space X. And let be the local resolvent set of T at . Then we prove that a complex number belongs to if and only if there is a sequence in X such that for n = 0, 1, 2,..., = x and is bounded.
Hyuk Han, Jong-Kwang Yoo
openaire +1 more source
Metric Dimension of Crystal Cubic Carbon Structure
Journal of Mathematics, 2021 For any given graph G, we say W⊆VG is a resolving set or resolves the graph G if every vertex of G is uniquely determined by its vector of distances to the vertices in W. The metric dimension of G is the minimum cardinality of all the resolving sets. The
Xiujun Zhang, Muhammad Naeem
doaj +1 more source
Double Metric Resolvability in Convex Polytopes
Journal of Mathematics, 2022 Nowadays, the study of source localization in complex networks is a critical issue. Localization of the source has been investigated using a variety of feasible models.
Muhammad Ahmad +4 more
doaj +1 more source
Studies of Multilevel Networks via Fault-Tolerant Metric Dimensions
IEEE Access, 2022 A subset $T$ of the vertex set of a network $G$ is called a resolving set for $G$ if each pair of vertices of $G$ have distinct representations with respect to $T$ . A resolving set $B^{\prime} $ among all the resolving sets of a network $G$
Imtiaz Ali +2 more
doaj +1 more source