Results 281 to 290 of about 8,830,736 (317)

Resolving-power dominating sets

Applied Mathematics and Computation, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stephen, Sudeep, Rajan, Bharati, Grigorious, Cyriac, William, Albert   +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, 2008
Conflict 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, P Renée, Williams, Marcia, Rachel, Olivia, Martin   +3 more
openaire   +2 more sources

Spider‐specific probe set for ultraconserved elements offers new perspectives on the evolutionary history of spiders (Arachnida, Araneae)

Molecular Ecology Resources, 2020
Phylogenomic methods have proven useful for resolving deep nodes and recalcitrant groups in the spider tree of life. Across arachnids, transcriptomic approaches may generate thousands of loci, and target‐capture methods, using the previously designed ...
Siddharth Kulkarni, Hannah M. Wood, Michael W. Lloyd, G. Hormiga   +3 more
semanticscholar   +1 more source

Hermitian Geometry on Resolvent Set

2018
For 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

Maker–Breaker Resolving Game

Bulletin of the Malaysian Mathematical Sciences Society, 2020
A set of vertices W of a graph G is a resolving set if every vertex of G is uniquely determined by its vector of distances to W. In this paper, the Maker–Breaker resolving game is introduced.
Cong X. Kang, S. Klavžar, I. G. Yero, Eunjeong Yi   +3 more
semanticscholar   +1 more source

On large sets of resolvable and almost resolvable oriented triple systems

Journal of Combinatorial Designs, 1996
Summary: 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, 2023
Vaidya, S. K., Kelaiya, J. B.
openaire   +1 more source

The Full Automorphism Groups, Determining Sets and Resolving Sets of Coprime Graphs

Graphs and Combinatorics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Junyao Pan, Xiuyun Guo
openaire   +2 more sources

On independent resolving number of TiO2 [m, n] nanotubes

Journal of Intelligent & Fuzzy Systems, 2018
Let G (V, E) be a Graph. A set W ⊆ V of vertices resolves a graph G if every vertex of G is uniquely determined by its vector of distances to the vertices in W. The metric dimension of G is the minimum cardinality of a resolving set.
S. Prabhu, T. Flora, M. Arulperumjothi
semanticscholar   +1 more source

Weakly connected resolving sets in graphs

Discrete Mathematics, Algorithms and Applications
Harary 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, A. Wilson Baskar, R. Sundareswaran, V. Swaminathan   +3 more
openaire   +2 more sources