Results 91 to 100 of about 976,099 (318)
The Vertex-Rainbow Index of A Graph
The k-rainbow index rxk(G) of a connected graph G was introduced by Chartrand, Okamoto and Zhang in 2010. As a natural counterpart of the k-rainbow index, we introduce the concept of k-vertex-rainbow index rvxk(G) in this paper.
Mao Yaping
doaj +1 more source
Counting with 3-valued truth tables of bracketed formulae connected by\n implication [PDF]
Volkan Yildiz
openalex +1 more source
Real‐time assay of ribonucleotide reductase activity with a fluorescent RNA aptamer
Ribonucleotide reductases (RNR) synthesize DNA building blocks de novo, making them crucial in DNA replication and drug targeting. FLARE introduces the first single‐tube real‐time coupled RNR assay, which enables isothermal tracking of RNR activity at nanomolar enzyme levels and allows the reconstruction of allosteric regulatory patterns and rapid ...
Jacopo De Capitani +4 more
wiley +1 more source
Generalized Rainbow Connection of Graphs and their Complements
Let G be an edge-colored connected graph. A path P in G is called ℓ-rainbow if each subpath of length at most ℓ + 1 is rainbow. The graph G is called (k, ℓ)-rainbow connected if there is an edge-coloring such that every pair of distinct vertices of G is ...
Li Xueliang +3 more
doaj +1 more source
Poly[aqua(μ1,1-azido)(μ-3H-1,2,3-triazolo[4,5-b]pyridin-3-olato)cobalt(II)]
In the title compound, [Co(C5H3N4O)(N3)(H2O)]n, the cobalt ion is coordinated by three N atoms of two organic ligands, two N atoms of two azide anions and one water molecule in a distorted octahedral geometry.
Jiong-Peng Zhao, Fu-Chen Liu
doaj +1 more source
A theorem on n-connected graphs
AbstractThe following result is proved: Every finite n-connected graph G contains either a vertex of valency n or an edge e such that the graph arising from G by the deletion of e remains n-connected.
openaire +1 more source
Gauged
Pietro Fré +4 more
openalex +1 more source
Disordered but rhythmic—the role of intrinsic protein disorder in eukaryotic circadian timing
Unstructured domains known as intrinsically disordered regions (IDRs) are present in nearly every part of the eukaryotic core circadian oscillator. IDRs enable many diverse inter‐ and intramolecular interactions that support clock function. IDR conformations are highly tunable by post‐translational modifications and environmental conditions, which ...
Emery T. Usher, Jacqueline F. Pelham
wiley +1 more source
The discrete cocompact subgroups of the five-dimensional connected, simply connected nilpotent Lie groups are determined up to isomorphism. Moreover, we prove if G = N × A is a connected, simply connected, nilpotent Lie group with an Abelian factor A ...
Amira Ghorbel, Hatem Hamrouni
doaj +1 more source
NOTE ON HOMOTOPY NORMALITY AND THE n-CONNECTED FIBER SPACE
An \(H\)-map \(i:Y\to X\) of simply connected homotopy associative \(H\)-spaces is called mod \(p\) homotopy normal, if \(c_X(X_{(p)} \times i(Y_{(p)}))\) can be deformed into \(i(Y_{(p)})\). Here \(c_X:X \times X\to X\) is the commutator map \((x,y)\mapsto (x\cdot y)\cdot (\sigma(x) \cdot\sigma (y))\) with \(\sigma:X\to X\) a homotopy inversion.
Kudou, Kenji, Yagita, Nobuaki
openaire +3 more sources

