Results 41 to 50 of about 312,664 (251)
ON THE PRIME GRAPH OF SIMPLE GROUPS [PDF]
Bulletin of the Australian Mathematical Society, 2014 AbstractLet $G$ be a finite group, let ${\it\pi}(G)$ be the set of prime divisors of $|G|$ and let ${\rm\Gamma}(G)$ be the prime graph of $G$. This graph has vertex set ${\it\pi}(G)$, and two vertices $r$ and $s$ are adjacent if and only if $G$ contains an element of order $rs$.
Burness, Tim C, Covato, Elisa
openaire +3 more sources
FEBS Letters, EarlyView.Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi +5 more
wiley +1 more source
The Second Subconstituent of some Strongly Regular Graphs [PDF]
, 2010 This is a report on a failed attempt to construct new graphs that are strongly regular with no triangles. The approach is based on the assumption that the second subconstituent has an equitable partition with four parts.
Biggs, Norman
core +1 more source
, 2015 We show that every 3-regular circle graph has at least two pairs of twin vertices; consequently no such graph is prime with respect to the split decomposition.
Traldi, Lorenzo
core +2 more sources
Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10
FEBS Letters, EarlyView.Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang +8 more
wiley +1 more source
Quasirecognition by prime graph of U_3(q) where 2 < q =p^{alpha} < 100 [PDF]
International Journal of Group Theory, 2012 Let G be a finite group and let Gamma(G) be the prime graphof G. Assume 2 < q = p^{alpha} < 100 . We determine finite groupsG such that Gamma(G) = Gamma(U_3(q)) and prove that if q neq3, 5, 9, 17, then U_3(q) is quasirecognizable by prime graph,i.e., if ...
Ali Iranmanesh +3 more
doaj
On the Prime Graph Question for Integral Group Rings of 4-primary groups I
, 2017 We study the Prime Graph Question for integral group rings. This question can be reduced to almost simple groups by a result of Kimmerle and Konovalov. We prove that the Prime Graph Question has an affirmative answer for all almost simple groups having a
Bächle, Andreas, Margolis, Leo
core +2 more sources
, 2017 Let be a graph. A prime cordial labeling of with vertex set is a bijection from to such that if each edge is assigned the label when gcd and otherwise, then the difference between the number of edges labeled with and the number of edges labeled with is at most . A graph which admits prime cordial labeling is called a prime cordial graph. In
M. Bhuvaneshwari +2 more
openaire +1 more source
Time after time – circadian clocks through the lens of oscillator theory
FEBS Letters, EarlyView.Oscillator theory bridges physics and circadian biology. Damped oscillators require external drivers, while limit cycles emerge from delayed feedback and nonlinearities. Coupling enables tissue‐level coherence, and entrainment aligns internal clocks with environmental cues.
Marta del Olmo +2 more
wiley +1 more source
Random Cyclic Triangle-Free Graphs of Prime Order
Journal of Mathematics, 2021 Cyclic triangle-free process (CTFP) is the cyclic analog of the triangle-free process. It begins with an empty graph of order n and generates a cyclic graph of order n by iteratively adding parameters, chosen uniformly at random, subject to the ...
Yu Jiang +3 more
doaj +1 more source