Results 51 to 60 of about 976,099 (318)
On k-con-Critically n-Connected Graphs
Journal of Combinatorial Theory, Series B, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Introduction Cognitive impairment and exercise intolerance are common in dialysis patients. Cerebral perfusion and oxygenation play a major role in both cognitive function and exercise execution; HD session per se aggravates cerebral ischemia in this population. This study aimed to compare cerebral oxygenation and perfusion at rest and in mild
Marieta P. Theodorakopoulou +10 more
wiley +1 more source
The Super-Connectivity of Kneser Graphs
Discussiones Mathematicae Graph Theory, 2019 A vertex cut of a connected graph G is a set of vertices whose deletion disconnects G. A connected graph G is super-connected if the deletion of every minimum vertex cut of G isolates a vertex.
Ekinci Gülnaz Boruzanli +1 more
doaj +1 more source
Fragments in 2-Critically n-Connected Graphs
Journal of Combinatorial Theory, Series B, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Mapping the evolution of mitochondrial complex I through structural variation
FEBS Letters, EarlyView.Respiratory complex I (CI) is crucial for bioenergetic metabolism in many prokaryotes and eukaryotes. It is composed of a conserved set of core subunits and additional accessory subunits that vary depending on the organism. Here, we categorize CI subunits from available structures to map the evolution of CI across eukaryotes. Respiratory complex I (CI)
Dong‐Woo Shin +2 more
wiley +1 more source
Hosoya Polynomials of Generalized Vertex Identified and Edge Introducing Graphs [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2013 The vertex identified and edge introducing graphs of two disjoint connected graphs are extended to n, , disjoint connected graphs. Hosoya polynomials and Wiener indices of such composite graphs are obtained by applying Gutman's Theorem and using ...
Ahmed Ali, Noor Dahash
doaj +1 more source
DECOMPOSING THE SU(N) CONNECTION AND THE WU–YANG POTENTIAl [PDF]
Modern Physics Letters A, 2002 Based on the decomposition of SU(2) gauge field, we derive a generalization of the decomposition theory for the SU (N) gauge field. We thus obtain the invariant electromagnetic tensors of SU (N) groups and the extended Wu–Yang potentials. The sourceless solutions are also discussed.
Duan, Yishi, Zhang, Pengming
openaire +2 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
On locally k-critically n-connected graphs
Discrete Mathematics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Intersection of sets with 𝑛-connected unions [PDF]
Proceedings of the American Mathematical Society, 1997 We show that if n n sets in a topological space are given so that all the sets are closed or all are open, and for each k ≤ n k\le n every k k of the sets have a ( k − 2 ) (k-2) -connected union, then the n n
Horvath, Charles D., Lassonde, Marc
openaire +2 more sources