Results 261 to 270 of about 4,511,459 (292)

Cybervictimization, self-esteem, and cyberaggression endorsement in Thai university students: evidence from a two-part zero-inflated model. [PDF]

Front Psychol
Suradom C, Na Bangsai P, Wattanatchariya K, Seesen M, Quan X, Wongpakaran N, Wongpakaran T.   +6 more
europepmc   +1 more source

Longitudinal association between social interaction and screen-positive cognitive impairment risk in older adults: domain-specific effects and the impact of baseline cognitive status. [PDF]

Front Public Health
Li S, Kakuda A, Sawada Y, Zhang J, Shigeeda M, Zhang Z, Qian M, Zhao R, Gao H, Kinoshita H, Okumura R, Kawasaki Y, Anme T.   +12 more
europepmc   +1 more source

On Semiprime Rings of Bounded Index [PDF]

Proceedings of the American Mathematical Society, 1982
A ring R R is of bounded index (of nilpotency) if there is an integer
Efraim P. Armendariz
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Functions of Bounded Index, Bounded Value Distribution and v-Bounded Index

Nonlinear Analysis: Theory, Methods & Applications, 1987
If for an entire function f there exists an integer N such that for all \(z\in {\mathbb{C}}\) and \(k\in {\mathbb{N}}\) \[ \max_{0\leq j\leq N}\{| f^{(j)}(z)| /j!\}\geq | f^{(k)}(z)| /k!, \] then f is called of bounded index and the least number N is called the ``index'' of f.
S M Shāh, Ranjan Roy
exaly   +2 more sources

An Upper Bound for the Chainable Index

Journal of Mathematical Sciences, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alpin, Yu. A., Guterman, A. E., Shafeev, E. R.   +2 more
openaire   +2 more sources

On Bounded Value Distribution and Bounded Index

Nonlinear Analysis: Theory, Methods & Applications, 1978
S M Shāh
exaly   +3 more sources

Bounds on the Steiner–Wiener index of graphs

Discrete Mathematics, Algorithms and Applications, 2021
Let S be a set of vertices of a connected graph G. The Steiner distance of S is the minimum size among all connected subgraphs of G containing the vertices of S. The sum of all Steiner distances on sets of size k is called the Steiner k-Wiener index.
V. A. Rasila, Ambat Vijayakumar
openaire   +1 more source

Bounds for the Randić Connectivity Index

Journal of Chemical Information and Computer Sciences, 1999
For a saturated hydrocarbon with n carbon atoms and m carbon-carbon bonds and with Randic connectivity index chi, two functions, L = L(n,m) and U = U(n,m), are determined, such that L < or = chi < U. These bounds are better than those previously reported; for most chemically relevant values of n and m there exist hydrocarbons for which chi = L or chi =
Ivan Gutman, Oswaldo Araujo, Daniel A. Morales   +2 more
openaire   +3 more sources