Results 121 to 130 of about 7,398 (287)

Connected domination in graphs

open access: yes, 2005
A connected dominating set D is a set of vertices of a graph G=(V,E) such that every vertex in V-D is adjacent to at least one vertex in D and the subgraph induced by the set D is connected.
Mahalingam, Gayathri
core  

On graphs for which the connected domination number is at most the total domination number. Discrete [PDF]

open access: yes, 2012
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.
Oliver Schaudt
core  

Connected Dominating Sets [PDF]

open access: yes, 2009
Wireless sensor networks (WSNs) are now widely used in many applications. However, routing in WSNs is very challenging due to the inherent characteristics that distinguish these networks from other wireless networks. The concept of hierarchical routing is widely used to perform energy-efficient routing in WSNs.
Yiwei Wu, Yingshu Li
openaire   +1 more source

Screening and epitope characterization of Nidogen‐2‐specific nanobodies

open access: yesFEBS Open Bio, EarlyView.
Camel immunization and phage display were employed to generate high‐affinity VHH nanobodies against Nidogen‐2. After library construction, biopanning, ELISA screening, sequencing, and recombinant expression, selected nanobodies were purified and characterized, leading to the preliminary exploration of a nanobody‐based sandwich ELISA for specific ...
Jianchuan Wen   +9 more
wiley   +1 more source

Iron homeostasis disruption and lipid peroxidation in skeletal muscle during short‐term immobilization

open access: yesFEBS Open Bio, EarlyView.
14‐day casting‐induced immobilization reduced gastrocnemius muscle mass and increased non‐heme iron and ferritin heavy chain levels. Despite iron accumulation, transferrin receptor 1 and iron regulatory protein 2 were paradoxically upregulated. Lipid peroxidation was elevated without compensatory antioxidant responses.
Haruka Yokogawa   +2 more
wiley   +1 more source

Large‐scale bidirectional arrayed genetic screens identify OXR1 and EMC4 as modifiers of αSynuclein aggregation

open access: yesFEBS Open Bio, EarlyView.
Activation of the mitochondrial protein OXR1 increases pSyn129 αSynuclein aggregation by lowering ATP levels and altering mitochondrial membrane potential, particularly in response to MSA‐derived fibrils. In contrast, ablation of the ER protein EMC4 enhances autophagic flux and lysosomal clearance, broadly reducing α‐synuclein aggregates.
Sandesh Neupane   +11 more
wiley   +1 more source

Why human connection is the true metric of research success

open access: yesFEBS Open Bio, EarlyView.
Human‐centred mentorship can be shaped by mentor attributes, actions, intrinsic drive and career ambition. Drawing on reflections across Singapore and France, as well as workshop insights from FEBS‐IUBMB ENABLE 2024, this article shows that human‐centred mentorship creates the conditions for sustainable growth, well‐being and retention in research ...
Timothy Lin Yun Tan   +3 more
wiley   +1 more source

Connected equitable domination in graphs

open access: yes, 2012
Let G = (V,E) be a graph. A subset D of V is called an equitable dominating set of a graph G if for every v . V -D, there exists a vertex v . D such that uv .
Sivakumar, S.   +3 more
core   +1 more source

YIPFα1A expression is regulated by multilayered molecular mechanisms

open access: yesFEBS Open Bio, EarlyView.
YIPFα1A, a five‐pass Golgi protein, is regulated at multiple layers. (1) Rare‐codon enrichment drives translation‐coupled mRNA decay. (2) A proximal 3′‐UTR element stabilizes mRNA. (3) A distal 3′‐UTR element included by alternate poly(A) site usage represses translation, which can be overridden by the proximal 3′‐UTR element.
Tokio Takaji   +2 more
wiley   +1 more source

Domination Numbers in Graphs Resulting from Shackle Operations with Linkage of any Graph

open access: yesJTAM (Jurnal Teori dan Aplikasi Matematika)
The domination number is the number of dominating nodes in a graph that can dominate the surrounding connected nodes with a minimum number of dominating nodes. This domini number is denoted by γ(G). In this research, we will examine the domination number
Ilham Saifudin   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy