Results 71 to 80 of about 14,233,339 (289)

Forecasting the Dialysis Burden in Japan: Validation‐Based Projections of Prevalence and Incidence Through 2050

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Japan has one of the highest dialysis prevalence rates worldwide and a shrinking, aging population. Whether dialysis burden has entered a sustained post‐peak phase or whether recent declines partly reflect pandemic‐related disruptions remains uncertain.
Hatice Şahin   +2 more
wiley   +1 more source

When the connected domination number is at most the total domination number [PDF]

open access: yes, 2011
In this note we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number.
Schaudt, Oliver
core   +2 more sources

Reciprocal control of viral infection and phosphoinositide dynamics

open access: yesFEBS Letters, EarlyView.
Phosphoinositides, although scarce, regulate key cellular processes, including membrane dynamics and signaling. Viruses exploit these lipids to support their entry, replication, assembly, and egress. The central role of phosphoinositides in infection highlights phosphoinositide metabolism as a promising antiviral target.
Marie Déborah Bancilhon, Bruno Mesmin
wiley   +1 more source

On the Total Outer k-Independent Domination Number of Graphs

open access: yesMathematics, 2020
A set of vertices of a graph G is a total dominating set if every vertex of G is adjacent to at least one vertex in such a set. We say that a total dominating set D is a total outer k-independent dominating set of G if the maximum degree of the subgraph ...
Abel Cabrera-Martínez   +3 more
doaj   +1 more source

Total domination subdivision numbers of graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2004
Summary: A set \(S\) of vertices in a graph \(G=(V,E)\) is a total dominating set of \(G\) if every vertex of \(V\) is adjacent to a vertex in \(S\). The total domination number of \(G\) is the minimum cardinality of a total dominating set of \(G\). The total domination subdivision number of \(G\) is the minimum number of edges that must be subdivided (
Teresa W. Haynes   +2 more
openaire   +2 more sources

Spatiotemporal and quantitative analyses of phosphoinositides – fluorescent probe—and mass spectrometry‐based approaches

open access: yesFEBS Letters, EarlyView.
Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho   +3 more
wiley   +1 more source

Lower bounds for the domination number and the total domination number of direct product graphs [PDF]

open access: yes, 2010
A sharp lower bound for the domination number and the total domination number of the direct product of finitely many complete graphs is given: γ(×i=1tKni)≥t+1,t≥3.
Gašper Mekiš, Mekiš, Gašper
core   +1 more source

Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation

open access: yesFEBS Letters, EarlyView.
Protein pyrophosphorylation is an unusual signaling mechanism that was discovered two decades ago. It can be driven by inositol pyrophosphate messengers and influences various cellular processes. Herein, we summarize the research progress and challenges of this field, covering pathways found to be regulated by this posttranslational modification as ...
Sarah Lampe   +3 more
wiley   +1 more source

Total dominator chromatic number of a graph [PDF]

open access: yesTransactions on Combinatorics, 2015
Given a graph $G$, the total dominator coloring problem seeks a proper coloring of $G$ with the additional property that every vertex in the graph is adjacent to all vertices of a color class. We seek to minimize the number of color classes.
Adel P. Kazemi
doaj  

On graphs with equal total domination and connected domination numbers

open access: yesApplied Mathematics Letters, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Home - About - Disclaimer - Privacy