Results 241 to 250 of about 280,140 (285)

<i>Pseudomonas aeruginosa</i> dynamically prioritizes motility and resource recycling during prolonged starvation. [PDF]

mSystems
Munro FD, Ambulte E, Hemsley CM, Bergkessel M.   +3 more
europepmc   +1 more source

Correction: N6‑methyladenosine‑modified TRAF1 promotes sunitinib resistance by regulating apoptosis and angiogenesis in a METTL14‑dependent manner in renal cell carcinoma. [PDF]

Mol Cancer
Chen Y, Lu Z, Qi C, Yu C, Li Y, Huan W, Wang R, Luo W, Shen D, Ding L, Ren L, Xie H, Xue D, Wang M, Ni K, Xia L, Qian J, Li G.   +17 more
europepmc   +1 more source

All-trans retinoic acid modulates proliferation and apoptosis of secondary hair follicle-dermal papilla cells in cashmere goats via the TGF-<i>β</i>2/Smad2/3 pathway. [PDF]

Front Vet Sci
Gao Y, Gao G, Zhang X, Lian W, Wu X, Cui K, Zhu L, Jiang G, Xu Z, Wang J, Peng M, Ding R, Liu D, Cang M, Hao F.   +14 more
europepmc   +1 more source

Mitochondrial DNA Damage in Substantia Nigra Pars Compacta Astrocytes Exacerbates Dopaminergic Neuron Loss in a 6-Hydroxydopamine Mouse Model of Parkinsonism. [PDF]

Cell Mol Neurobiol
Ayala DA, Hall GM, Das D, Tijerina E, Villagran LL, Khan Z, Paliwal D, Anand A, Rimer M, Srinivasan R.   +9 more
europepmc   +1 more source

Identification of PsbS binding proteins in <i>Arabidopsis thaliana</i> leaf chloroplasts under high light using TurboID-based proximity labeling. [PDF]

Front Plant Sci
Jiao Y, Dou Y, Wang L, Zhu XG, Zheng H.
europepmc   +1 more source

Comparative Evaluation of Deep Learning Graph Neural Networks and Classical Machine Learning Models for Predicting Heats of Combustion as a Key Hazard Indicator under GHS/CLP Standards. [PDF]

ACS Omega
Nnyigide OS, Byeon H, Okpete UE.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On Partitional Labelings of Graphs

Mathematics in Computer Science, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rikio Ichishima, Akito Oshima
openaire   +2 more sources

Binary Labeling of Graphs

Graphs and Combinatorics, 1997
A mapping \(f: E\to\{0,1\}^m\) of a graph \(G=(V,E)\) is called a mod 2 coding of \(G\), if the induced mapping \(g:V\to \{0,1\}^m\), defined by \(g(v)= \sum_{u\in V,\{u,v\}\in E}f(\{u,v\})\) assigns a different number to each vertex, where summations are taken modulo 2.
Louis Caccetta, Rui-Zhong Jia
openaire   +2 more sources

Pair Labelings of Graphs

SIAM Journal on Discrete Mathematics, 1992
Summary: Given a graph \(G\) and positive integer \(d\), the pair-labeling number \(r^*(G,d)\) is the minimum \(n\) such that each vertex in \(G\) can be assigned a pair of numbers from \(\{0,1,\dots,n-1\}\) so that any two numbers used at adjacent vertices differ by at least \(d\) modulo \(n\).
David R. Guichard, John W. Krussel
openaire   +1 more source