Results 131 to 140 of about 29,676 (268)
On odd-graceful coloring of graphs [PDF]
For a graph G(V, E) which is undirected, simple, and finite, we denote by |V | and |E| the cardinality of the vertex set V and the edge set E of G, respectively. A graceful labeling f for the graph G is an injective function f : V → {0, 1, 2, . . . , |E|}
I. Nengah Suparta (21320564) +3 more
core
Energy Science &Engineering, EarlyView.This paper proposes a decentralized peer‐to‐peer federated learning framework for wind turbine bearing remaining useful life prediction, introducing a virtual client paradigm in which statistical health indicators serve as independent feature‐level clients—enabling privacy‐preserving collaborative prognostics from a single physical asset under ...
Jihene Sidhom +2 more
wiley +1 more source
Towards the Graceful Tree Conjecture: A Survey [PDF]
A graceful labelling of an undirected graph G with n edges is a one-to-one function from the set of vertices of G to the set {0, 1, 2,...,n} such that the induced edge labels are all distinct. An induced edge label is the absolute value of the difference
Brankovic, Ljiljana +3 more
core
iMetaMed, EarlyView.Applying single‐cell RNA‐seq techniques to large‐scale clinical phenotypic data enables the discovery of differential disease progression trajectories and the construction of data‐driven progression scores. These can then be integrated into precision medicine studies to investigate the drivers of patient‐specific disease outcomes. ABSTRACT We propose a
Christian Anderson +11 more
wiley +1 more source
Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A (2‐dimensional) realisation of a graph G $G$ is a pair ( G , p ) $(G,p)$, where p $p$ maps the vertices of G $G$ to R 2 ${{\mathbb{R}}}^{2}$. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise.
Katie Clinch +5 more
wiley +1 more source
Pelabelan Graceful Satu Modulo Pada Beberapa Graf Eule [PDF]
, 2014 . A graph with edges is said to be one modulo graceful graph () if there is a injective function from vertex set of graph to in such a way that induces a function from edge set of graph to defined as is bijective.
Ratnasari, L. (Lucia), Isa, I. (Isa)
core
Journal of the Society for Information Display, EarlyView.Switchable‐privacy displays can be used to protect sensitive data in public spaces and to avoid driver distraction on codriver displays. The key optical parameters are the luminance in public and privacy modes, measured over the viewing angle, and the image quality for the intended observers.
Karlheinz Blankenbach
wiley +1 more source
In [3], the authors adapted the edge-graceful graph labeling definition into block designs. In this article, we adapt the line-graceful graph labeling definition into block designs and define a block design $(V,\mathcal{B})$ with $|V|=v$ as line-graceful
Erdemir, Dilara, Kolotoğlu, Emre
core
How can children and young people have a voice in urban treescapes?
People and Nature, EarlyView.Abstract Scientific understanding of climate change has, to date, failed to result in sufficient action. This paper proposes that a deficit model of top‐down learning and dissemination in relation to public engagement with science may be part of the problem, particularly when considering the attitudes, values and empowerment of children and young ...
Simon Carr +10 more
wiley +1 more source
Responsive Materials, EarlyView.Machine learning provides a unifying framework to connect structure, fluorescence properties, and applications of carbon‐based quantum dots. This review highlights how data‐driven strategies enable fluorescence regulation, reveal underlying mechanisms, and accelerate the rational design of functional carbon dots.
Liangfeng Chen +8 more
wiley +1 more source