Results 71 to 80 of about 2,192 (158)
The Plant Genome, Volume 19, Issue 1, March 2026.Abstract Cupuassu (Theobroma grandiflorum) is a fruit tree native to the Brazilian Amazon and increasingly relevant to regional bioeconomies. Its cultivation is severely affected by witches’ broom disease (WBD), caused by Moniliophthora perniciosa. While a chromosome‐scale genome of the susceptible genotype C1074 is available, the lack of a resistant ...
Vinicius A. C. de Abreu +8 more
wiley +1 more source
On D-distance (anti)magic labelings of shadow graph of some graphs
Electronic Journal of Graph Theory and ApplicationsSummary: Let \(G\) be a graph with vertex set \(V(G)\) and diameter \(\operatorname{diam}(G)\). Let \(D\subseteq \{0, 1, 2, 3, \dots, \operatorname{diam}(G)\}\) and \(\varphi : V(G) \rightarrow \{1, 2, 3, \dots, |V(G)|\}\) be a bijection. The graph \(G\) is called \(D\)-\textit{distance magic}, if \(\sum_{s \in N_D(t)} \varphi (s)\) is a constant for ...
Anak Agung Gede Ngurah +2 more
openaire +2 more sources
Earth's Future, Volume 14, Issue 3, March 2026.Abstract Limitations in the temporal resolution of contemporary gravity satellite missions hinder the precise monitoring of rapid Earth surface mass changes. By the early 2030s, unprecedented high‐temporal monitoring of Earth's dynamic mass redistribution will be available using the temporal gravity field derived from the Hybrid Gravity Satellite ...
Zhengwen Yan +6 more
wiley +1 more source
Note on group distance magic complete bipartite graphs
Open Mathematics, 2013 Abstract A Γ-distance magic labeling of a graph G = (V, E) with |V| = n is a bijection ℓ from V to an Abelian group Γ of order n such that the weight $$w(x) = \sum\nolimits_{y \in N_G (x)} {\ell (y)}$$ of every vertex x ∈ V is equal to the same element µ ∈ Γ, called the magic constant.
openaire +4 more sources
How to Be Hopeful About Climate Change
American Anthropologist, Volume 128, Issue 1, Page 148-158, March 2026.ABSTRACT Why do people in climate‐vulnerable regions of Kenya and Namibia express more hope for the future than many in Germany, despite facing greater environmental threats? Drawing on ethnographic research and the philosophy of Gabriel Marcel, we make two arguments.
Julian Sommerschuh, Michael Schnegg
wiley +1 more source
Group distance magic graphs $G\times C_n$
, 2013 A $ $-distance magic labeling of a graph $G=(V,E)$ with $|V | = n$ is a bijection $f$ from $V$ to an Abelian group $ $ of order $n$ such that the weight $w(x)=\sum_{y\in N_G(x)}f(y)$ of every vertex $x \in V$ is equal to the same element $ \in $, called the \emph{magic constant}.
openaire +2 more sources
Self-reverse labelings of distance magic graphs
A graph is distance magic if it admits a bijective labeling of its vertices by integers from $1$ up to the order of the graph in such a way that the sum of the labels of all the neighbors of a vertex is independent of a given vertex. We introduce the concept of a self-reverse distance magic labeling of a regular graph which allows for a more compact ...
Kovář, Petr +2 more
openaire +2 more sources
The Hitchhiker's Guide to the Surface Code. [PDF]
Entropy (Basel)Zhang F, Chen J.
europepmc +1 more source
Distance Magic Labeling of Corona Product of Graphs
InPrime: Indonesian Journal of Pure and Applied MathematicsLet G = (V, E) is a graph with order n, and f: V(G) → {1,2,...,n} is a bijection. For any vertex v ϵ V, the sum of f(u) is called the weight of vertex v, denoted by w(v), where N(v) is the set of neighbors of vertex v. If the labeling f satisfies that there exists a constant k such that w(v)=k, for every vertex v in the graph G, then f is called a ...
openaire +1 more source
HasLoss: a novel Hassanat distance-based loss functions for binary classification. [PDF]
Front Artif IntellTarawneh AS.
europepmc +1 more source