Results 221 to 230 of about 8,068,470 (244)
Some of the next articles are maybe not open access.
The fault‐tolerant beacon set of hexagonal Möbius ladder network
Mathematical methods in the applied sciences, 2023In localization, some specific nodes (beacon set) are selected to locate all nodes of a network, and if an arbitrary node stops working and still selected nodes remain in the beacon set, then the chosen nodes are called fault‐tolerant beacon set.
M. Faisal Nadeem, Muhammad Azeem
semanticscholar +1 more source
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
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 +3 more
semanticscholar +1 more source
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 +3 more
semanticscholar +1 more source
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
The general position problem and strong resolving graphs
Open Mathematics, 2019The general position number gp(G) of a connected graph G is the cardinality of a largest set S of vertices such that no three pairwise distinct vertices from S lie on a common geodesic.
S. Klavžar, I. G. Yero
semanticscholar +1 more source
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 +3 more
semanticscholar +1 more source
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 +3 more
semanticscholar +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