Results 81 to 90 of about 7,398 (287)
Ubiquitination of secretory granules promotes their crinophagic degradation in Drosophila
FEBS Letters, EarlyView.Ubiquitination of secretory granules in Drosophila larval salivary glands is a critical molecular trigger for crinophagy, the lysosomal degradation of unreleased, or low‐quality granules. The E3 ubiquitin ligase Cnot4 is recruited to the surface of secretory granules to induce crinophagy.
Tamás Csizmadia +6 more
wiley +1 more source
Connected power domination number of product graphs
, 2022 In this paper, we consider the connected power domination number ($\gamma_{P, c}$) of three standard graph products. The exact value for $\gamma_{P, c}(G\circ H)$ is obtained for any two non-trivial graphs $G$ and $H.$ Further, tight upper bounds are ...
Ganesamurthy, S. +2 more
core
, 2023 Let be a simple connected graph of order Let be the family of connected vertex-edge dominating sets in with cardinality .The polynomial is called the connected vertex - edge domination polynomial of G, where is the number of connected vertex - edge ...
Devendra Jangiti +2 more
core +1 more source
Molecular Oncology, Volume 20, Issue 6, Page 1513-1534, June 2026.Nanosecond infrared laser (NIRL) low‐volume sampling combined with shotgun lipidomics uncovers distinct lipidome alterations in oropharyngeal squamous cell carcinoma (OPSCC) of the palatine tonsil. Several lipid species consistently differentiate tumor from healthy tissue, highlighting their potential as diagnostic markers.
Leonard Kerkhoff +11 more
wiley +1 more source
Approximation hardness of dominating set problems in bounded degree graphs
, 2008 We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum Set Cover we prove the first explicit approximation lower bounds for various
Chlebikova, Janka +4 more
core +1 more source
[1,2] -Connected domination number of graphs
, 2021 A set in a graph G is said to be a -connected dominating set if for every vertex , and is connected. The minimum cardinality of a -connected dominating set is called the -connected domination number and is denoted by .
et. al., G. Mahadevan,
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
Alternative Domination in Graphs
AKCE International Journal of Graphs and CombinatoricsSometimes while you are using the Internet, for example, via a Wi-Fi network from one of the companies, the Internet is suddenly cut off due to a malfunction at that point, which disrupts your important work on the Internet, so there is a need for ...
Ali Mohammed Sahal
doaj +1 more source
Vertex and edge covers with clustering properties: complexity and algorithms [PDF]
, 2009 We consider the concepts of a t-total vertex cover and a t-total edge cover (t≥1), which generalise the notions of a vertex cover and an edge cover, respectively.
Fernau, Henning +3 more
core +1 more source
Molecular Oncology, EarlyView.Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson +9 more
wiley +1 more source