Results 71 to 80 of about 116,736 (298)
Alternating cycles and paths in edge-coloured multigraphs: A survey [PDF]
, 1997 A path or cycle in an edge-coloured multigraph is called alternating if its successive edges differ in colour. We survey results of both theoretical and algorithmic character concerning alternating cycles and paths in edge-coloured multigraphs.
Gutin, Gregory +3 more
core +1 more source
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
Protocol for quantifying miRNA trafficking across the endosomal membrane
FEBS Open Bio, EarlyView.An in vitro protocol measures miRNA uptake into endosomes isolated from mammalian cell extracts, which are free of subcellular contaminants. Performed at 37 °C in the presence of ATP, it ensures the import of single‐stranded miRNA into the endosomal lumen.
Syamantak Ghosh +2 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
Identifying codes and locating-dominating sets on paths and cycles [PDF]
Discrete Applied Mathematics, 2009 Let G=(V,E) be a graph and let r>=1 be an integer. For a set [email protected]?V, define N"r[x]={[email protected]?V:d(x,y)@?r} and D"r(x)=N"r[x]@?D, where d(x,y) denotes the number of edges in any shortest path between x and y.
Chun-Xia Chen, Changhong Lu, Z. Miao
semanticscholar +1 more source
BCG vaccination potentiates oxidative phosphorylation in neonatal myeloid‐derived suppressor cells
FEBS Open Bio, EarlyView.BCG vaccination enhances oxidative phosphorylation in neonatal MDSCs, impairing their immunosuppressive function. It upregulates electron transport chain genes and mitochondrial activity, increasing ATP and oxygen consumption. Pharmacological OXPHOS inhibition partially restores suppressive capacity, confirming causality.
Yingying Chen, Hui Li
wiley +1 more source
Heavy paths and cycles in weighted graphs [PDF]
, 1998 A weighted graph is a graph in which each edge $e$ is assigned a non-negative number $w(e)$, called the weight of $e$. In this paper, some theorems on the existence of long paths and cycles in unweighted graphs are generalized to heavy paths and cycles ...
Zhang, S. +3 more
core +2 more sources
Recent insights into the molecular mechanism of ubiquinol oxidation by cytochrome bc1
FEBS Open Bio, EarlyView.The review reflects on the mechanism of the catalytic reaction in cytochrome bc1: the electron bifurcation that involves the separation of two electrons derived from the quinol oxidation to opposite sides of the enzyme across the membrane. This review summarizes the long‐standing effort to understand the mechanism of quinol oxidation catalyzed by ...
Anna Wójcik‐Augustyn +2 more
wiley +1 more source
γ-Cycles And Transitivity By Monochromatic Paths In Arc-Coloured Digraphs
Discussiones Mathematicae Graph Theory, 2013 We call the digraph D an m-coloured digraph if its arcs are coloured with m colours. If D is an m-coloured digraph and a ∈ A(D), colour(a) will denote the colour has been used on a.
Casas-Bautista Enrique +2 more
doaj +1 more source
Roman Domination Number of the Cartesian Products of Paths and Cycles
Electronic Journal of Combinatorics, 2012 Roman domination is an historically inspired variety of domination in graphs, in which vertices are assigned a value from the set $\{0,1,2\}$ in such a way that every vertex assigned the value 0 is adjacent to a vertex assigned the value 2.
P. Pavlic, J. Žerovnik
semanticscholar +1 more source