Results 71 to 80 of about 108,525 (194)
Injective choice functions for countable families
Journal of Combinatorial Theory, Series B, 1976 AbstractThis paper proves a necessary and sufficient condition for an arbitrary countable family of sets to have an injective choice function. Some applications are indicated.
Podewski, Klaus-Peter, Steffens, Karsten
openaire +2 more sources
Classifying Resolving Lists by Distances between Members
Theory and Applications of Graphs, 2016 L Let $G$ be a connected graph and let $w_1,\cdots w_r$ be a list of vertices. We refer the choice of a triple $(r;G;w_1,\cdots w_r)$, as a {\em metric selection.} Let $\rho$ be the shortest path metric of $G$. We say that $w_1,\cdots w_r$ {\em resolves $
Paul Feit
doaj +1 more source
Influence of Epidural Steroid Injection on Adrenal Function
Clinics in Orthopedic Surgery, 2019 Spinal diseases are self-limited or non-progressive in many cases. Epidural steroid injection (ESI) is a common nonsurgical treatment option for spinal pain. Despite concerns about complications of repeated steroid injection, few studies reported on the adrenal function of spine disease patients undergoing surgery after ESI.
Shin, Won Shik +4 more
openaire +2 more sources
Local analytic regularity in the linearized Calder\'on problem
, 2015 We consider the linearization of the Dirichlet-to-Neumann (DN) map as a function of the potential. We show that it is injective at a real analytic potential for measurements made at an open subset of analyticity of the boundary. More generally, we relate
Sjoestrand, Johannes, Uhlmann, Gunther
core +4 more sources
α-Labelings of a Class of Generalized Petersen Graphs
Discussiones Mathematicae Graph Theory, 2015 An α-labeling of a bipartite graph Γ of size e is an injective function f : V (Γ) → {0, 1, 2, . . . , e} such that {|ƒ(x) − ƒ(y)| : [x, y] ∈ E(Γ)} = {1, 2, . . .
Benini Anna, Pasotti Anita
doaj +1 more source
On the strong beta-number of galaxies with three and four components
AKCE International Journal of Graphs and Combinatorics, 2020 The beta-number of a graph is the smallest positive integer for which there exists an injective function such that each is labeled and the resulting set of edge labels is for some positive integer . The beta-number of is if there exists no such integer .
Rikio Ichishima +2 more
doaj +1 more source
Injectivity and surjectivity of Collatz functions
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Some methods for constructing some classes of graceful uniform trees
Indonesian Journal of Combinatorics, 2018 A tree T(V, E) is graceful if there exists an injective function f from the vertex set V(T) into the set {0, 1, 2, ..., ∣V∣ − 1} which induces a bijective function fʹ from the edge set E(T) onto the set {1, 2, ..., ∣E∣}, with fʹ(uv) = ∣f(u) − f(v)∣ for ...
I Nengah Suparta +1 more
doaj +1 more source
Mathematical Modelling and Analysis, 1997 In this paper we study the existence and multiplicity solutions of nonlinear elliptic problem of the form Here Ω is a smooth and bounded domain in RN , N ≥ 2, λ ∈ R and f : R → R is a continuous, even function satisfying the following condition
Jan Beczek
doaj +1 more source
The Jordan lattice completion and a note on injective envelopes and von Neumann algebras
, 2018 The article associates two fundamental lattice constructions with each regular unital real ordered Banach space (function system). These are used to establish certain results in the theory of operator algebras, specifically relating the injective ...
Haag, Ulrich
core