Results 101 to 110 of about 40,584 (295)
Regular graphs with four eigenvalues
We study the connected regular graphs with four distinct eigenvalues. Properties and feasibility conditions of the eigenvalues are found. Several examples, constructions and characterizations are given, as well as some uniqueness and nonexistence results.
Dam, E.R. van
core +2 more sources
On the extreme complexity of certain nearly regular graphs
Theory and Applications of GraphsThe complexity of a graph is the number of its labeled spanning trees. It is demonstrated that the seven known triangle-free strongly regular graphs are graphs of maximal complexity among all graphs of the same order and degree; their complements are ...
Gregory P Constantine, Gregory C Magda
doaj +1 more source
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
Distance-Regular Graphs with Strongly Regular Subconstituents [PDF]
Journal of Algebraic Combinatorics, 1997 The main result of the article is a theorem about distance-regular graphs of diameter \(d\geq 3\) with all subconstituents being strongly regular graphs. The author shows that these are precisely the Taylor graphs \((d=3\) and \(|\Gamma_3 (u) |=1)\) or graphs with \(a_1= 0\), \(a_i\leq 1\) for \(2\leq i\leq d\).
openaire +2 more sources
Classification of some strongly regular subgraphs of the McLaughlin graph
, 2008 By means of an exhaustive computer search we have proved that the strongly regular graphs with parameters (v,k,λ,μ)=(105,32,4,12), (120,42,8,18) and (176,70,18,34) are unique up to isomorphism.
Degraer, J. +5 more
core +1 more source
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
Developments on Spectral Characterizations of Graphs
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph.
Dam, E.R. van, Haemers, W.H.
core +2 more sources
A (57, 14, 1) strongly regular graph does not exist
, 1983 We show that a strongly regular graph with parameters n=57, k=14, λ=1, ν=4 ( (0,1)-eigenvalues: 1∗14, 38∗2, 18∗(−5); (1, −1)-eigenvalues: 1∗28, 38∗(− 5), 18∗9) does not ...
Wilbrink, H.A., Brouwer, A.E.
core +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 strongly regular graphs [PDF]
, 2009 Strongly regular graphs are regular graphs with the additional property that the number of common neighbours for two vertices depends only on whether the vertices are adjacent or non-adjacent. From an algebraic point of view, a graph is strongly regular
Behbahani, Majid
core