Results 1 to 10 of about 870 (267)
Fractal and Fractional, 2022 This article primarily focuses on the approximate controllability of fractional semilinear integrodifferential equations using resolvent operators. Two alternative sets of necessary requirements have been studied.
V Vijayakumar +2 more
exaly +3 more sources
An Introduction to Spectral Theory of Bounded Linear Operators in Intuitionistic Fuzzy Pseudo Normed Linear Space [PDF]
Sahand Communications in Mathematical Analysis, 2022 In this paper, focus is on the study of spectrum and the spectral properties of bounded linear operators in intuitionistic fuzzy pseudo normed linear spaces(IFPNLS).
Bivas Dinda +2 more
doaj +1 more source
Independent resolving sets in graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2021 Let be a connected graph. Let be a subset of V with an order imposed on W. The k-vector is called the resolving vector of v with respect to W. The set W is called a resolving set if for any two distinct vertices In this paper we investigate the existence of independent resolving sets in Cartesian product and corona of graphs.
B. Suganya, S. Arumugam 0001
openaire +2 more sources
Resolving SINR Queries in a Dynamic Setting [PDF]
SIAM Journal on Computing, 2020 We consider a set of transmitters broadcasting simultaneously on the same frequency under the SINR model. Transmission power may vary from one transmitter to another, and a transmitter's signal strength at a given point is modeled by the transmitter's power divided by some constant power $α$ of the distance it traveled.
Boris Aronov +2 more
openaire +5 more sources
Resolving Sets and Semi-Resolving Sets in Finite Projective Planes [PDF]
The Electronic Journal of Combinatorics, 2012 In a graph $\Gamma=(V,E)$ a vertex $v$ is resolved by a vertex-set $S=\{v_1,\ldots,v_n\}$ if its (ordered) distance list with respect to $S$, $(d(v,v_1),\ldots,d(v,v_n))$, is unique. A set $A\subset V$ is resolved by $S$ if all its elements are resolved by $S$. $S$ is a resolving set in $\Gamma$ if it resolves $V$.
Héger, Tamás, Takáts, Marcella
openaire +4 more sources
On two resolvent matrices of the truncated Hausdorff matrix moment problem
Visnik Harkivsʹkogo Nacionalʹnogo Universitetu im. V.N. Karazina. Cepiâ Matematika, Prikladna Matematika i Mehanika, 2022 We consider the truncated Hausdorff matrix moment problem (THMM) in case of a finite number of even moments to be called non degenerate if two block Hankel matrices constructed via the moments are both positive definite matrices.
A. E. Choque-Rivero +1 more
doaj +1 more source
Secure Resolving Sets in a Graph [PDF]
Symmetry, 2018 Let G = (V, E) be a simple, finite, and connected graph. A subset S = {u1, u2, …, uk} of V(G) is called a resolving set (locating set) if for any x ∈ V(G), the code of x with respect to S that is denoted by CS (x), which is defined as CS (x) = (d(u1, x), d(u2, x), .., d(uk, x)), is different for different x.
Hemalathaa Subramanian +1 more
openaire +1 more source
Journal of Mathematics, 2021 In this paper, we study a set-valued extended generalized nonlinear mixed variational inequality problem and its generalized resolvent dynamical system. A three-step iterative algorithm is constructed for solving set-valued extended generalized nonlinear
Iqbal Ahmad +3 more
doaj +1 more source
Certain Varieties of Resolving Sets of A Graph [PDF]
Journal of the Indonesian Mathematical Society, 2021 Let G=(V,E) be a simple connected graph. For each ordered subset S={s_1,s_2,...,s_k} of V and a vertex u in V, we associate a vector Gamma(u/S)=(d(u,s_1),d(u,s_2),...,d(u,s_k)) with respect to S, where d(u,v) denote the distance between u and v in G. A subset S is said to be resolving set of G if Gamma(u/S) not equal to Gamma(v/S) for all u, v in V-S ...
Sooryanarayana, Badekara +2 more
openaire +1 more source
From resolvents to generalized equations and quasi-variational inequalities: existence and differentiability [PDF]
Journal of Nonsmooth Analysis and Optimization, 2022 We consider a generalized equation governed by a strongly monotone and Lipschitz single-valued mapping and a maximally monotone set-valued mapping in a Hilbert space. We are interested in the sensitivity of solutions w.r.t. perturbations of both mappings.
Gerd Wachsmuth
doaj +1 more source