Results 281 to 290 of about 1,449 (308)
Some of the next articles are maybe not open access.
Hermitian geometry on the resolvent set (II)
Science China Mathematics, 2021The authors study the connection between an element belonging to a unital \(C^*\)-algebra and the properties of the metric concerning curvature, arc length, completeness and singularity. For Part I, see [Oper. Theory: Adv. Appl. 267, 167--183 (2018; Zbl 1454.47009)].
Douglas, Ronald G., Yang, Rongwei
openaire +2 more sources
On Doubly Resolving Sets in Graphs
Bulletin of the Malaysian Mathematical Sciences Society, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 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
Resolving sets and integer programs for recommender systems
Journal of Global Optimization, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alain Hertz, Tsvi Kuflik, Noa Tuval
openaire +1 more source
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
Connected resolving sets in graphs
Ars Comb., 2003A resolving set in a graph \(G\) is an ordered subset \(\{w_1,\dots ,w_k\}\) of its vertices with the following property: For each two vertices \(u\) and \(v\), there exists \(i\), \(1\leq i\leq k\), such that the distances from \(w_i\) to \(u\) and \(v\) are different. A resolving set of the smallest cardinality is called a basis.
Varaporn Saenpholphat, Ping Zhang 0004
openaire +1 more source
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
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
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
Resolving Indeterminacy in Dynamic Settings: The Role of Shocks*
Quarterly Journal of Economics, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frankel, David, Pauzner, Ady
openaire +2 more sources