Results 91 to 100 of about 6,739 (277)
4−Equitable Tree Labelings [PDF]
We assign the labels {0,1,2,3} to the vertices of a graph; each edge is assigned the absolute difference of the incident vertices’ labels. For the labeling to be 4−equitable, we require the edge labels and vertex labels to each be distributed as ...
Coles, Zena +3 more
core +2 more sources
RNA structural profiling of Turnip Yellow Mosaic Virus by DMS‐MaPseq and DREEM analyses uncover that viral genome‐wide RSS is highly complicated and heterogeneous, with alternative RSSs widely distributed across the genome. Notably, the viral 3’ tRNA‐like structure adopts alternative conformations in vivo.
Jiaying Zhu +7 more
wiley +1 more source
Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs
Solairaju and Chithra introduced a new type of labeling of a graph G with p vertices and q edges called an edge odd graceful labeling if there is a bijection f from the edges of the graph to the set {1, 3, ...
S. N. Daoud
doaj +1 more source
Equitable Labelings of Caterpillar Graphs [PDF]
The Graceful Tree Conjecture in graph theory has been open for almost half a century. The conjecture states that the vertices of any tree can be labeled with distinct integers between 0 and the number of edges of the tree in a way that the edges can be ...
Burek, Mark +2 more
core +2 more sources
On cordial labeling of hypertrees
Let $f:V\rightarrow\mathbb{Z}_k$ be a vertex labeling of a hypergraph $H=(V,E)$. This labeling induces an~edge labeling of $H$ defined by $f(e)=\sum_{v\in e}f(v)$, where the sum is taken modulo $k$.
Tuczyński, Michał +2 more
core +1 more source
On the Role of Preprocessing and Memristor Dynamics in Reservoir Computing for Image Classification
ABSTRACT Reservoir computing (RC) is an emerging recurrent neural network architecture that has attracted growing attention for its low training cost and modest hardware requirements. Memristor‐based circuits are particularly promising for RC, as their intrinsic dynamics can reduce network size and parameter overhead in tasks such as time‐series ...
Rishona Daniels +4 more
wiley +1 more source
The role of each Mn site in the Na3‐xMn[Mn(CN)6]·zH2O compounds’ redox activity was investigated using a combined experimental–computational approach, which shows that only the low‐spin Mn‐C site undergoes redox changes (Mn1+ to Mn4+), while high‐spin Mn‐N remains unchanged. The study confirms the presence of the Mn1+ intermediate and newly reveals its
Zhenying Li +11 more
wiley +1 more source
Two Rosa-type Labelings of Uniform k-distant Trees and a New Class of Trees [PDF]
A k-distant tree consists of a main path, called the spine, such that each vertex on the spine is joined by an edge to an end-vertex of at most one path on at most k vertices.
Wenger Diller, Kimberly
core +1 more source
Topology‐Aware Machine Learning for High‐Throughput Screening of MOFs in C8 Aromatic Separation
We screened 15,335 Computation‐Ready, Experimental Metal–Organic Frameworks (CoRE‐MOFs) using a topology‐aware machine learning (ML) model that integrates structural, chemical, pore‐size, and topological descriptors. Top‐performing MOFs exhibit aromatic‐enriched cavities and open metal sites that enable π–π and C–H···π interactions, serving as ...
Yu Li, Honglin Li, Jialu Li, Wan‐Lu Li
wiley +1 more source
On alpha labeling of tensor product of paths and cycles. [PDF]
L U, G R.
europepmc +1 more source

