Results 51 to 60 of about 42,675 (259)
On size multipartite Ramsey numbers for stars versus paths and cycles
Electronic Journal of Graph Theory and Applications, 2017 Let $K_{l\times t}$ be a complete, balanced, multipartite graph consisting of $l$ partite sets and $t$ vertices in each partite set. For given two graphs $G_1$ and $G_2$, and integer $j\geq 2$, the size multipartite Ramsey number $m_j(G_1,G_2)$ is the ...
Anie Lusiani +2 more
doaj +1 more source
Domination game on paths and cycles
Ars Mathematica Contemporanea, 2017 Domination game is a game on a simple graph played by two players, Dominator and Staller, who are alternating in taking turns. In each turn a player chooses a vertex in such a way that at least one new vertex gets dominated by this move. The game ends when all vertices are dominated, and thus no legal move is possible.
openaire +3 more sources
FEBS Open Bio, EarlyView.Cytosolically synthesized chloroplast preproteins are translocated across the outer and inner envelope membranes through translocons called TOC and TIC, respectively. In green algae and plants, the TIC core is composed of essential membrane proteins, Tic12, Tic20, and Tic214.
Mengyi Li, Xueyang Zhao, Masato Nakai
wiley +1 more source
Transversals of Longest Paths and Cycles [PDF]
SIAM Journal on Discrete Mathematics, 2014 Let G be a graph of order n. Let lpt(G) be the minimum cardinality of a set X of vertices of G such that X intersects every longest path of G and define lct(G) analogously for cycles instead of paths. We prove that lpt(G) \leq ceiling(n/4-n^{2/3}/90), if G is connected, lct(G) \leq ceiling(n/3-n^{2/3}/36), if G is 2-connected, and \lpt(G) \leq 3, if G ...
Dieter Rautenbach +1 more
openaire +2 more sources
FEBS Open Bio, EarlyView.This paper reveals how human lactoferrin–albumin fusion (hLF‐HSA) potently suppresses lung adenocarcinoma cell migration. hLF‐HSA upregulates NHE7, leading to Golgi alkalization, disruption of the Golgi secretome, downregulation of MMP1, and reversal of EMT. These findings suggest a novel Golgi‐targeting strategy to suppress cancer cell migration.
Hana Nopia +3 more
wiley +1 more source
Conjectures About Wheels Without One Edge with Paths and Cycles
MathematicsThe crossing number cr(G) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main aim of this paper is to give the crossing numbers of the join products G*+Pn and G*+Cn for the connected graph G* obtained by ...
Michal Staš, Mária Timková
doaj +1 more source
Directed evolution of enzymes at the crossroads of tradition and innovation
FEBS Open Bio, EarlyView.An iterative cycle of data‐driven enzyme optimization comprising four stages: genetic diversification of a template enzyme, expression of protein variants, high‐throughput evaluation, and machine‐learning‐guided redesign of the next variant library.
Maria Tomkova +2 more
wiley +1 more source
Paths and cycles in colored graphs [PDF]
Australas. J Comb., 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Broersma, Hajo +3 more
openaire +3 more sources
Optimizing photoexcitation conditions for time‐resolved X‐ray solution scattering experiments
FEBS Open Bio, EarlyView.Time‐resolved X‐ray solution scattering (TR‐XSS) is a powerful technique to visualize how proteins change their structure in real time after light activation. Selecting the right laser photoexcitation conditions—fluence, excitation geometry, and sample refresh rate—is critical to maximize the experimental signal while avoiding unwanted side effects ...
Matteo Levantino
wiley +1 more source