Results 221 to 230 of about 48,502 (244)

Testing Longitudinal Measurement Invariance of the Dutch PSS-10, MBI-ES, and PANAS in a Bimonthly 6-Month Panel. [PDF]

Psychol Belg
Van de Velde J, Weijters B, Levecque K.
europepmc   +1 more source

Naturalist Identity and Biodiversity Conservation: The Mediating Role of Obligation. [PDF]

Psych J
Meng Y, Chen J.
europepmc   +1 more source

Developing and validating multi-scenario EFL willingness to communicate scale across classroom, extracurricular, and GenAI-mediated scenarios. [PDF]

BMC Psychol
Zhong W, Zhou Z, Wang L, Yang Y.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Metric and Strong Metric Dimension in Cozero-Divisor Graphs

Mediterranean Journal of Mathematics, 2021
Several graphs are associated with commutative rings and they are used as combinatorial tools to study algebraic properties of commutative rings. Let \(R\) be a commutative ring with nonzero identity and \(W^*(R)\) be the set of all nonzero and nonunit elements of \(R.\) The cozero-divisor graph of \(R,\) denoted by \(\Gamma^\prime (R)\) is a graph ...
Reza Nikandish, Maharram Bakhtyiari, M J Nikmehr   +2 more
exaly   +2 more sources

On the Strong Metric Dimension of Annihilator Graphs of Commutative Rings

Bulletin of the Malaysian Mathematical Sciences Society, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Reza Nikandish
exaly   +2 more sources

On the Strong Metric Dimension of Certain Nanostructures

Journal of Computational and Theoretical Nanoscience, 2017
Let G(V, E) be a connected graph. A vertex w strongly resolves a pair of vertices u,v in V if there exists some shortestu–w path containing V or some shortest v–w path containing u. A set w ⊂ V of vertices is called a strong resolving set for G if every pair of vertices of V\W is strongly resolved by some vertex of w .
Muhammad Imran, Bharati Rajan
exaly   +2 more sources

Fault-tolerant strong metric dimension of graphs

Discrete Mathematics, Algorithms and Applications, 2022
In this paper, we introduce a variant of strong metric dimension, called the fault-tolerant strong metric dimension. A strong resolving set [Formula: see text] for [Formula: see text] is fault-tolerant if [Formula: see text] is also a strong resolving set, for each [Formula: see text] in [Formula: see text], and the fault-tolerant strong metric ...
Sathish Krishnan, Bharati Rajan
openaire   +2 more sources

The Fractional Strong Metric Dimension of Graphs

2013
For any two vertices x and y of a graph G, let S{x, y} denote the set of vertices z such that either x lies on a y − z geodesic or y lies on a x − z geodesic. For a function g defined on V(G) and U ⊆ V(G), let g(U) = ∑ x ∈ Ug(x). A function g: V(G) → [0,1] is a strong resolving function of G if g(S{x, y}) ≥ 1, for every pair of distinct vertices x, y ...
Cong X. Kang, Eunjeong Yi
openaire   +1 more source