Results 91 to 100 of about 9,781,779 (300)
ABSTRACT Introduction Peritoneal dialysis (PD) is an established home‐based kidney replacement therapy (KRT), but its uptake remains low in Japan. We evaluated whether individualized education in a dedicated outpatient clinic was associated with the initiation of PD.
Yasuko Ito +7 more
wiley +1 more source
Bounds on the Clique and the Independence Number for Certain Classes of Graphs
In this paper, we study the class of graphs Gm,n that have the same degree sequence as two disjoint cliques Km and Kn, as well as the class G¯m,n of the complements of such graphs.
Valentin E. Brimkov, Reneta P. Barneva
doaj +1 more source
A generalization for the clique and independence numbers
In this paper, lower and upper bounds for the clique and independence numbers are established in terms of the eigenvalues of the signless Laplacian matrix of a given graph G.
Maden (Gungor), A. Dilek +1 more
openaire +2 more sources
ABSTRACT Introduction Hyperlipidemia is a major risk factor for atherosclerotic cardiovascular disease (ASCVD). Although statins are the cornerstone of lipid‐lowering therapy, their use may be limited in some patients by adverse effects. This study evaluated the possible impact of non‐drug treatment using double‐filtration plasmapheresis (DFPP) on CD14+
Yun Cheng +3 more
wiley +1 more source
On the number of maximum independent sets of graphs [PDF]
Let $G$ be a simple graph. An independent set is a set of pairwise non-adjacent vertices. The number of vertices in a maximum independent set of $G$ is denoted by $alpha(G)$. In this paper, we characterize graphs $G$ with $n$ vertices and with maximum
Tajedin Derikvand, Mohammad Reza Oboudi
doaj
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
Independence numbers of polyhedral graphs
A polyhedral graph is a $3$-connected planar graph. We find the least possible order $p(k,a)$ of a polyhedral graph containing a $k$-independent set of size $a$ for all positive integers $k$ and $a$. In the case $k = 1$ and $a$ even, we prove that the extremal graphs are exactly the vertex-face (radial) graphs of maximal planar graphs.
Gaspoz S., Maffucci R. W.
openaire +6 more sources
Independence Number of Graphs with a Prescribed Number of Cliques
We consider the following problem posed by Erdős in 1962. Suppose that $G$ is an $n$-vertex graph where the number of $s$-cliques in $G$ is $t$. How small can the independence number of $G$ be? Our main result suggests that for fixed $s$, the smallest possible independence number undergoes a transition at $t=n^{s/2+o(1)}$. In the case of triangles ($s=
Tom Bohman, Dhruv Mubayi
openaire +4 more sources
Diversity and complexity in neural organoids
Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source
Understanding judicial independence in Vanuatu [PDF]
: This paper is intended to fill a gap in the literature concerning the Vanuatu judiciary, as this topic is rarely addressed other than in reports by international non-government organisations, such as Transparency International and its local chapter ...
Miranda Forsyth
core

