Results 301 to 310 of about 8,016,307 (335)

Resolving Sets in Temporal Graphs

open access: yesInternational Workshop on Combinatorial Algorithms
A \emph{resolving set} $R$ in a graph $G$ is a set of vertices such that every vertex of $G$ is uniquely identified by its distances to the vertices of $R$.
Jan Bok, Antoine Dailly, Tuomo Lehtilä
semanticscholar   +4 more sources

On Doubly Resolving Sets in Graphs

Bulletin of the Malaysian Mathematical Sciences Society, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. Jannesari
semanticscholar   +3 more sources

Hermitian geometry on the resolvent set (II)

Science China Mathematics, 2021
The 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

RETRACTED: Resolving-power domination number of probabilistic neural networks

Journal of Intelligent & Fuzzy Systems, 2022
Power utilities must track their power networks to respond to changing demand and availability conditions to ensure effective and efficient operation. As a result, several power companies continuously employ phase measuring units (PMUs) to continuously ...
Retraction Notice   +5 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy