Results 61 to 70 of about 408 (250)
Advanced Science, EarlyView.An origami worm‐inspired robot achieves multimodal locomotion in confined pipelines through mechatronic integration that embeds actuation, control, and communication within each origami module. Large, reversible configuration and dimensional changes enable 25 gaits synthesized by a unified framework across peristaltic, inchworm, and wheel‐rolling modes
Qiwei Zhang +6 more
wiley +1 more source
Ordered graceful labellings of the 2-star
Discrete Mathematics, 2001 The authors investigate ordered graceful labellings of 2-stars. They give a lower bound on the number of non-equivalent ordered graceful labellings by constructing an exponential number of such labellings. This shows that a conjecture of Cahit is false.
Richard J. Nowakowski +1 more
openaire +2 more sources
Advanced Science, EarlyView.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
Alpha graphs with different pendent paths
Electronic Journal of Graph Theory and Applications, 2020 Graceful labelings are an effective tool to find cyclic decompositions of complete graphs and complete bipartite graphs. The strongest kind of graceful labeling, the α-labeling, is in the center of the research field of graph labelings, the existence of ...
Christian Barrientos
doaj +1 more source
ON k-GRACEFUL LABELING OF SOME GRAPHS
Journal of applied mathematics & informatics, 2016 Summary: In this paper, it has been shown that the hairy cycle \(C_{n}\odot rK_{1},\) \(n\equiv 3\pmod 4\), the graph obtained by adding pendant edge to each pendant vertex of hairy cycle \(C_{n}\odot 1K_{1}\), \(n\equiv 0\pmod 4\), double graph of path \(P_{n}\) and double graph of comb \(P_{n}\odot 1K_{1}\) are \(k\)-graceful.
Pradhan, P., Kumar, Kamesh
openaire +3 more sources
PlantGFM: A Genomic Foundation Model for Discovery and Creation of Plant Genes
Advanced Science, EarlyView.A plant genomic foundation model pre‐trained on 12 species enables both accurate gene prediction and de novo gene design. Through AI‐human knowledge screening, seven designed sequences showed transcriptional activity in plants, with two expressing stable proteins—demonstrating the first DNA‐RNA‐protein expression of LLM‐generated genes in plants and ...
Changhao Li +10 more
wiley +1 more source
Graceful Labeling of Balanced Stars of Paths
Electronic Notes in Discrete Mathematics, 2003 Abstract If the vertices of a tree on n vertices are labeled by the distinct numbers l,2,…, n , in such a way that the set of edge-differences (i.e., the differences between the labels on adjacent pairs of vertices) is exactly {1, 2,…, n − 1}, then such a labeling is called a graceful labeling. The graceful tree conjecture of Ringel and Kotzig
R. Badrinath, Pratima Panigrahi
openaire +1 more source
Advanced Science, EarlyView.This study reveals a metabolic signaling axis in the OSCC microenvironment where palmitic acid (PA) drives the activation of CAFs. PA uptake triggers CEBPG‐dependent epigenetic remodeling to upregulate ERN1 and TMBIM6, thereby mitigating ER stress. This adaptive program sustains CAF survival and the pro‐metastatic phenotype, establishing this pathway ...
Yiling Duan +6 more
wiley +1 more source
Octagonal prime graceful labeling
Ratio MathematicaLet G be a graph with p vertices and q edges. Define a bijection f : V (G) → {1, 8, ..., p(3p - 2)} by f(vi) = i(3i - 2) for every i from 1 to p and define a 1 - 1 mapping fopgl ∗ : E(G) → set of natural number N such that f∗(uv) = |f(u) - f(v)| for all ...
V Akshaya
doaj +1 more source
Graceful and Cordial Labeling Of Subdivision Of Graphs
Electronic Notes in Discrete Mathematics, 2016 Abstract An edge uv is said to be subdivided if the edge uv is replaced by the path P : u w v , where w is the new vertex. A graph obtained by subdividing each edge of a graph G is called subdivision of the graph G, and is denoted by S ( G ) .
K. Sankar, G. Sethuraman 0001
openaire +1 more source