Results 41 to 50 of about 1,212,791 (104)
Odd Fibonacci edge irregular labeling for some trees obtained from subdivision and vertex identification operations [PDF]
, 2023 ليكن G رسما بيانيا برؤوس p وحواف q و دالة متباينة وشاملة , حيث k عدد صحيح موجب. إذا كانت تسمية الحافة المستحثة معرفة ب لكل المتباينة, فان علامة التبويب تدعى وضع علامات غير منتظمة على حافة فيبوناتشي الفردية ل G.
Arockiaraj, S. +2 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 +10 more
wiley +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
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
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
Odd Fibonacci Stolarsky-3 Mean Labeling of Some Special Graphs [PDF]
, 2022 Let G be a graph with p vertices and q edges and an injective function where each is a odd Fibonacci number and the induced edge labeling are defined byand all these edge labeling are distinct is called Odd Fibonacci Stolarsky-3 Mean Labeling. A graph
Sandhya, S.S, Sree Vidya, M
core +1 more source
ChemSusChem, Volume 19, Issue 14, 29 July 2026.Hydrocarbon α,ω‐dienes are mainly produced from steam‐cracking derivatives, but high costs, complexity, and environmental impact limit their use. This review highlights sustainable paths from biomass and plastic upcycling, and surveys catalytic transformations into carbocycles and specialty polymers, emphasizing their role as modular building blocks ...
Rosa Villaccio, Giuseppe Leone
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.
core +1 more source
Natural Sciences, Volume 6, Issue 3, July 2026.An interrogation of T. S. Kuhn's dichotomy between Normal and Revolutionary Science through close inside examinations of three paradigm‐changing advances in molecular biology and immunology of the past 50 years. ABSTRACT The past 60 years have seen explosive changes in the fields of molecular biology and immunology that now affect clinical medicine as ...
Ellen V. Rothenberg
wiley +1 more source
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