Results 31 to 40 of about 146,548 (294)
Resolving-power dominating sets
Applied Mathematics and Computation, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sudeep Stephen +3 more
openaire +3 more sources
Resolving Independent Dominating Set pada Graf Bunga, Graf Gear, dan Graf Bunga Matahari
Contemporary Mathematics and Applications (ConMathA), 2023 Resolving independent dominating set is the development of metric dimension and independent dominating set. Resolving independent dominating sets is a concept which discusses about determining the minimum vertex on a graph provided that the vertex that ...
Rafiantika Megahniah Prihandini +4 more
doaj +1 more source
Semiclassical resolvent estimates at trapped sets [PDF]
Annales de l'Institut Fourier, 2012 We extend our recent results on propagation of semiclassical resolvent estimates through trapped sets when a priori polynomial resolvent bounds hold. Previously we obtained non-trapping estimates in trapping situations when the resolvent was sandwiched between cutoffs χ
Datchev, Kiril, Vasy, András
openaire +2 more sources
Levenshtein graphs: Resolvability, automorphisms & determining sets
Discrete Mathematics, 2023 22 pages, 3 ...
Perrin E. Ruth, Manuel E. Lladser
openaire +2 more sources
Non-Isolated Resolving Sets of Corona Graphs with Some Regular Graphs [PDF]
, 2022 Let G be a connected, simple, and finite graph. For an ordered set W={w1,w2,…,wk}⊆V(G) and a vertex v of G, the representation of v with respect to W is the k-vector r(v|W)=(dG(v,w1),…,dG(v,wk)) . The set W is called a resolving set of G, if every two
Salman, Anm +2 more
core +2 more sources
Metric and fault-tolerant metric dimension for GeSbTe superlattice chemical structure.
PLoS ONE, 2023 The concept of metric dimension has many applications, including optimizing sensor placement in networks and identifying influential persons in social networks, which aids in effective resource allocation and focused interventions; finding the source of ...
Liu Liqin +4 more
doaj +1 more source
Resolving sets tolerant to failures in three-dimensional grids
, 2021 An ordered set $S$ of vertices of a graph $G$ is a resolving set for $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of G is the minimum cardinality of a resolving set.
Salorio, María José Souto +6 more
core +1 more source
Kyoto Journal of Mathematics, 1986 We want to add here another two proofs that the resolvent set of a linear operator is open. The first proof depends on the Hahn-Banach theorem and the second on the Neumann series construction of a linear isomorphism between Ran(A-\(\lambda)\) and Ran(A-\(\mu)\).
Ikebe, Teruo, Yoshioka, Takashi
openaire +3 more sources
A Minimum Doubly Resolving Set and Strong Resolving Set for the Crystal Cubic Carbon
, 2022 Personal reasons, Professor Jia Bao Liu asked us not to mention his name in the article and to thank him only in the acknowledgments ...
Zafari, Ali, Alikhani, Saeid
openaire +2 more sources
Minimum weight resolving sets of grid graphs [PDF]
Discrete Mathematics, Algorithms and Applications, 2016 For a simple graph [Formula: see text] and for a pair of vertices [Formula: see text], we say that a vertex [Formula: see text] resolves [Formula: see text] and [Formula: see text] if the shortest path from [Formula: see text] to [Formula: see text] is of a different length than the shortest path from [Formula: see text] to [Formula: see text].
Andersen, Patrick +2 more
openaire +2 more sources