Results 141 to 150 of about 96,525 (309)
Journal of Combinatorial Theory, Series B, 1986 A spanning subgraph F of a graph G is called a [k-1,k]-factor if \(k-1\leq d_ F(x)\leq k\) for all vertices of x of G, where \(d_ F(x)\) denotes the degree of x in F. \textit{W. T. Tutte} [The subgraph problem, Ann. Discrete Math. 3, 289-295 (1978; Zbl 0377.05034)] proved that if r is an odd integer, then every r-regular graph has a [k-1,k]-factor for ...
openaire +3 more sources
FEBS Open Bio, EarlyView.In a murine model of myocardial ischemia and reperfusion (MI/R), the CD36 azapeptide ligand MPE‐298 reduces cardiac injury and transiently lowers left ventricular long‐chain fatty acids (LCFAs) accumulation 3 h after reperfusion, accompanied by a decrease of oxidative stress and inflammation‐associated genes' expression in the heart and adipose tissue.
Jade Gauvin +12 more
wiley +1 more source
Some applications of matching theorems
, 2010 PhDThis thesis contains the results of two investigations. The rst concerns the 1- factorizability of regular graphs of high degree. Chetwynd and Hilton proved in 1989 that all regular graphs of order 2n and degree 2n where > 1 2 ( p 7 1) 0 ...
Vaughan, Emil Richard
core
Transcripts enriched in codons that trigger P‐site tRNA‐mediated mRNA decay possess stable mRNA
FEBS Open Bio, EarlyView.PTMD codons were first described by Mendel et al. as mediators of an mRNA decay pathway dependent on the human protein CNOT3, homologous to yeast Not5. Our findings confirm that PTMD codons destabilize transcripts; however, unlike in yeast, the human pathway specifically targets and slightly destabilizes primarily stable mRNAs.
Rodolfo Lopes Carneiro +1 more
wiley +1 more source
FEBS Open Bio, EarlyView.Hyperosmotic stress triggers the relocation of the CFIm complex from the nucleus to the cytoplasm. This shift creates a nuclear ‘stoichiometric bottleneck’, limiting CFIm availability for mRNA processing. Consequently, specific mRNAs like NUDT21 and DICER1 undergo targeted 3′UTR shortening, demonstrating how spatial protein dynamics drive rapid ...
Hitomi Soumiya +2 more
wiley +1 more source
On distance-regularity in graphs
Journal of Combinatorial Theory, Series B, 1982 AbstractIf A is the adjacency matrix of a graph G, then Ai is the adjacency matrix of the graph on the same vertex set in which a pair of vertices is adjacent if and only if their distance apart is i in G. If G is distance-regular, then Ai is a polynomial of degree i in A. It is shown that the converse is also true.
openaire +1 more source
Graphs with Few Eigenvalues. An Interplay between Combinatorics and Algebra.
: Two standard matrix representations of a graph are the adjacency matrix and the Laplace matrix. The eigenvalues of these matrices are interesting parameters of the graph.
Dam, E.R. van
core
Evaluating the involvement of autolysosomes in the nuclear translocation of fluorescent proteins
FEBS Open Bio, EarlyView.Endogenously expressed fluorescent proteins can be degraded by autophagy and transported to cell nuclei via the nuclear pore complex. But in some cell lines, for example, HeLa cells which are positive for immunoreactivity of a receptor ligand, such as UCN I, in cell nuclei, fusion of autolysosome with the nuclear envelope is involved in the nuclear ...
Keiichi Ikeda
wiley +1 more source
Fixation Probabilities for Any Configuration of Two Strategies on Regular Graphs. [PDF]
Sci Rep, 2016 Chen YT, McAvoy A, Nowak MA.
europepmc +1 more source
Beyond Regular Semigroups [PDF]
, 2012 The topic of this thesis is the class of weakly U-abundant semigroups. This class is very wide, containing inverse, orthodox, regular, ample, adequate, quasi-adequate, concordant, abundant, restriction, Ehresmann and weakly abundant semigroups.
Wang, Yanhui
core