Results 251 to 260 of about 855,405 (264)
Some of the next articles are maybe not open access.
Resolving-power dominating sets
Applied Mathematics and Computation, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stephen, Sudeep +3 more
openaire +3 more sources
Resolving Conflict in the Home Care Setting
Home Healthcare Nurse: The Journal for the Home Care and Hospice Professional, 2008Conflict occurs when the needs of 2 or more people are incongruent and not being met simultaneously. Thomas defines conflict as “the process that begins when one party perceives that the other party has negatively affected, or is about to negatively affect, something he or she cares about” (cited ...
Rebecca, Askew +3 more
openaire +2 more sources
Hermitian Geometry on Resolvent Set
2018For a tuple \({A} = ({A}_{1}, {A}_{2}, \ldots, {A}_{n})\) of elements in a unital Banach algebra \(\mathcal{B}\), its projective joint spectrum P(A) is the collection of \({z} \in {\mathbb{C}}^{n}\) such that \({A}(z) = {z}_{1}{A}_{1} + {z}_{2}{A}_{2} + \cdots + {z}_{n}{A}_{n}\) is not invertible.
Ronald G. Douglas, Rongwei Yang
openaire +1 more source
On large sets of resolvable and almost resolvable oriented triple systems
Journal of Combinatorial Designs, 1996Summary: An \(\text{MTS} (v)\) [or \(\text{DTS} (v)]\) is said to be resolvable, denoted by \(\text{RMTS} (v)\) [or \(\text{RDTS} (v)]\), if its block set can be partitioned into parallel classes. An \(\text{MTS} (v)\) [or \(\text{DTS} (v)]\) is said to be almost resolvable, denoted by \(\text{ARMTS} (v)\) [or \(\text{ARDTS} (v)]\), if its block set ...
Kang, Qingde, Lei, Jianguo
openaire +2 more sources
EQUITABLE RESOLVING DOMINATING SETS IN GRAPHS
Advances and Applications in Discrete Mathematics, 2023Vaidya, S. K., Kelaiya, J. B.
openaire +1 more source
The Full Automorphism Groups, Determining Sets and Resolving Sets of Coprime Graphs
Graphs and Combinatorics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Junyao Pan, Xiuyun Guo
openaire +2 more sources
Weakly connected resolving sets in graphs
Discrete Mathematics, Algorithms and ApplicationsHarary and Melter introduced the concept of resolving sets in graphs. Slater stated the term locating set and the minimum resolving set as reference sets. Chartrand mentioned the locating set as a resolving set and the minimum cardinality of a resolving set as metric dimension or simply dimension in later stage.
J. Sivakumar +3 more
openaire +2 more sources
Resolving Resistances to Immediacy in the Group Setting
International Journal of Group Psychotherapy, 1993This article presents interventions appropriate to three forms of resistance commonly encountered in the group. One is the tendency of members to talk in the past tense instead of the present. A second is the disposition of members to dwell on the future. The third is their tendency to occupy the group with issues in their outside lives. Also mentioned
openaire +2 more sources
FEEDBACK RESOLVING SETS IN GRAPHS
Advances in Mathematics: Scientific Journal, 2020M. Rajeswari, A. Anitha, I. Sahul Hamid
openaire +1 more source