Results 31 to 40 of about 1,270,493 (107)

Kinetic Contribution to the Arbitrary Order Odd Frequency Moments of the Dynamic Structure Factor

Contributions to Plasma Physics, Volume 66, Issue 7-8, September 2026.
ABSTRACT An exact expression is derived for the kinetic contribution to the odd (arbitrary order) frequency moments of the dynamic structure factor via a finite summation that features averages of even (all lower orders) powers of the momentum over the exact momentum distribution.
Panagiotis Tolias, Tobias Dornheim, Jan Vorberger   +2 more
wiley   +1 more source

Odd Fibonacci edge irregular labeling for some trees obtained from subdivision and vertex identification operations [PDF]

, 2023
ليكن G  رسما بيانيا  برؤوس p وحواف q و  دالة متباينة وشاملة , حيث k عدد صحيح موجب. إذا كانت تسمية الحافة المستحثة  معرفة ب   لكل  المتباينة, فان علامة التبويب  تدعى وضع علامات غير منتظمة على حافة فيبوناتشي الفردية ل G.
Arockiaraj, S., Kamaraj, M., Devi, M. Uma, S. Arockiaraj, M. Uma Devi, M. Kamaraj   +5 more
core   +1 more source

PlantGFM: A Genomic Foundation Model for Discovery and Creation of Plant Genes

Advanced Science, Volume 13, Issue 46, 17 August 2026.
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, Qizhe Zhang, Hanchen Chen, Kepeng Lin, Chengfang Luo, Mengying Yang, Wei Xu, Fan Yao, Jianbing Yan, Qing‐Yong Yang, Xuehai Hu   +10 more
wiley   +1 more source

On the Odd Gracefulness of Cyclic Snakes With Pendant Edges

, 2021
Graceful and odd gracefulness of a graph are two entirely different concepts. A graph may posses one or both of these or neither. We present four new families of odd graceful graphs.
E. M. Badr
core   +1 more source

Invariant Measure and Universality of the 2D Yang–Mills Langevin Dynamic

Communications on Pure and Applied Mathematics, Volume 79, Issue 8, Page 1973-2102, August 2026.
ABSTRACT We prove that the Yang–Mills (YM) measure for the trivial principal bundle over the two‐dimensional torus, with any connected, compact structure group, is invariant for the associated renormalised Langevin dynamic. Our argument relies on a combination of regularity structures, lattice gauge‐fixing and Bourgain's method for invariant measures ...
Ilya Chevyrev, Hao Shen
wiley   +1 more source

Odd and Even Ratio Edge Antimagic Labeling [PDF]

, 2013
In this paper we introduce a new labeling namely odd and even ratio edge antimagic labeling and study the existence of this labeling for basic graph structures ...
Jayapriya, Jayapal, Thirusangu, K., K. Thirusangu, Jayapal Jayapriya   +3 more
core   +1 more source

Creating a Masterpiece. The Road to (and Beyond) Woodward and Hoffmann's 1969 Angewandte Chemie Treatise

The Chemical Record, Volume 26, Issue 8, August 2026.
This publication describes how R. B. Woodward and Roald Hoffmann crafted their masterpiece publications. Illustrations include Woodward's first draft of the famous “Violations There are none. Nor can violations be expected of so fundamental a principle of maximum bonding.” Original but discarded text shows the stepwise paths toward the W‐H masterpieces.
Jeffrey I. Seeman
wiley   +1 more source

Pelabelan Graceful Sisi-ganjil Pada Graf Web W(2,n) [PDF]

, 2014
Let G = (V(G),E()) be a graph with vertex set () and edge set (). Assume that graph G have edge. Graceful edge-odd labeling is a bijective map ∶ () → {1, 3, 5,…,2 – 1} that resulting map + : () → {0,1,2,…,2 −1} with
Ratnasari, L. (Lucia), Rizky, P. D. (Putri), Djuwandi, D. (Djuwandi)   +2 more
core  

Edge Odd Graceful Labeling for Different Paths using Padavon Sequence

International Journal of Computer Applications, 2013
The even graceful labeling of a graph G with q edges means that there is an injection f : V(G) to { 0,1,1,1,2,...,2q+i/i= 1 to n} such that when each edge uv is assigned the label |f(u) – f(v)| the resulting edge labels are {1,3,5,...,2q-1}. A graph which admits an edge odd graceful labeling is called an edgeodd graceful graph.
openaire   +1 more source

SUPER EDGE MAGIC GRACEFUL TOTAL LABELING OF SOME GRAPHS [PDF]

, 2019
Let a ( , ) p q graph G with the vertex set V G( ) , the edge set E G( ) , the number of vertices is p, and the number of edges is q. The edge magic graceful total labeling of graph G is a bijection from V G E G ( ) ( ) to the integers {1, 2,.
Wahyudi, Zainatul Fatimah Mutiara
core   +1 more source