Results 101 to 110 of about 43,787 (293)
Total $k$-distance domination critical graphs [PDF]
Transactions on Combinatorics, 2016 A set $S$ of vertices in a graph $G=(V,E)$ is called a total$k$-distance dominating set if every vertex in $V$ is withindistance $k$ of a vertex in $S$.
Doost Ali Mojdeh +3 more
doaj
Investigating transcription factor dynamics in health and disease using FRAP
FEBS Letters, EarlyView.FRAP analysis of GFP‐tagged transcription factors reveals how molecular mobility and target engagement change in response to drug treatment. By combining live‐cell imaging, quantitative model fitting, and statistical analysis, this approach uncovers transcription factor dynamics linked to disease mechanisms, providing a powerful framework for ...
Kannan Govindaraj +3 more
wiley +1 more source
Bounds on Global Total Domination in Graphs [PDF]
Computer Science Journal of Moldova, 2015 A subset $S$ of vertices in a graph $G$ is a \textit{global total dominating set}, or just GTDS, if $S$ is a \textit{total dominating set} of both $G$ and $\overline{G}$.
Nader Jafari Rad, Elahe Sharifi
doaj
FEBS Letters, EarlyView.The mycobacterial CIII‐CIV respiratory supercomplex is an obligate assembly, encompassing several subunits of unknown functions. We have characterized the intracellular subunit AscF, and show that it is unlikely to be a sensor for metals or nucleotides, but is required for growth on nonfermentable energy sources, and likely works as an adapter for ...
Eni Rile +8 more
wiley +1 more source
Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets [PDF]
, 2005 A total dominating set of a graph is a set of vertices such that every vertex is adjacent to a vertex in the set. We show that given a graph of order n with minimum degree at least 2, one can add at most (n-2n)/4+O(logn) edges such that the resulting ...
Dorfling, Michael +7 more
core +1 more source
Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment
Molecular Oncology, EarlyView.This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
wiley +1 more source
Locating Total Dominating Sets in the Join, Corona and Composition of Graphs [PDF]
, 2014 which is also a total dominating set is called a locating total dominating set of G. The minimum cardinality of a locating total dominating set of G is called the locating total domination number of G.
Benjamin N Omamalin +2 more
core
Partitioning the vertices of a cubic graph into two total dominating sets [PDF]
, 2017 A total dominating set in a graph G is a set S of vertices of G such that every vertex in G is adjacent to a vertex of S. We study cubic graphs whose vertex set can be partitioned into two total dominating sets.
Haynes, Teresa W. +5 more
core +1 more source
Molecular Oncology, EarlyView.Dimethyl fumarate (DMF) reduces growth of HPV‐positive cervical cancer spheroids and induces ferroptosis in cervical cancer cells via blocking SLC7A11/Glutathione (GSH) axis. Combination of subcytotoxic doses of DMF and cisplatin (CDDP) further suppresses spheroid growth and drives cell death in 2D culture models.
Carolina Punziano +6 more
wiley +1 more source