Results 81 to 90 of about 2,811,422 (296)
Strongly Regular Graphs with Parameters (4m4, 2m4 + m2, m4 + m2, m4 + m2) Exist for All m>1 [PDF]
Using results on Hadamard difference sets, we construct regular graphical Hadamard matrices of negative type of order 4m4 for every positive integer m. If m > 1, such a Hadamard matrix is equivalent to a strongly regular graph with parameters (4m4, 2m4 ...
Xiang, Q., Haemers, W.H.
core
Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry
EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri +5 more
wiley +1 more source
We consider antipodal graphs \(\Gamma\) of diameter 4 for which \(\Gamma_{1,2}\) is a strongly regular graph. A.A. Makhnev and D.V. Paduchikh noticed that, in this case, \(\Delta=\Gamma_{3,4}\) is a strongly regular graph without triangles.
Alexander A. Makhnev +2 more
doaj +1 more source
Recently, a construction of minimal codes arising from a family of almost Ramanujan graphs was shown. Ramanujan graphs are examples of expander graphs that minimize the second-largest eigenvalue of their adjacency matrix.
Valentino Smaldore
doaj +1 more source
Strongly regular grahphs and directed strongly regular graphs are introduced. Examples of strongly regular graphs are give: Conference graph and latin square graphs. The existence of a directed strongly regular graph with t=0.
Thomsen, Jakob Peter
core
Emerging experimental and computational methods for studying redox‐regulated structural transitions
Redox reactions can reshape proteins and alter how they behave in cells, with important consequences for health and disease. This review explores emerging experimental and computational approaches for discovering these redox‐sensitive protein switches, revealing their structural effects, and predicting their behavior, opening new opportunities to ...
Tasneem Rass +2 more
wiley +1 more source
Statistically strongly regular matrices and some core theorems
We define the statistically strongly regular matrices analogous to the strongly regular matrices, and further we use these matrices to establish necessary and sufficient conditions to prove some core theorems.
M. Mursaleen, Osama H. H. Edely
doaj +1 more source
How do genomes gain new functional parts? In eukaryotes, which tend to evolve under weak selection, much of the genome is junk. Palazzo and Qiu borrow the logic of Markov chains to show how non‐functional DNA becomes functional through the appearance of intermediate states, which arise due to epistasis, buffering, and biochemical messiness, allowing ...
Alexander F. Palazzo, Yi Qiu
wiley +1 more source
Strongly Involution k-regular nil clean ring
This article is about A-rings R, for which every element is a sum of an involution k-regular element and a nilpotent element, which commute with each other. These rings are called strongly involution k-regular nil-clean rings or SIKRNC rings.
Ali Shakir Mahmood +1 more
doaj +1 more source
On the Complexity of Identifying Strongly Regular Graphs
New result- GI is not AC0-reducible to isomorphism testing of conference graphs; fixed minor bugs and typos from previous ...
openaire +5 more sources

