Results 91 to 100 of about 490,847 (283)

Dominating sets in triangulations on surfaces

open access: yesArs Mathematica Contemporanea, 2011
A dominating set D of a graph G is a set such that each vertex v of G is either in the set or adjacent to a vertex in the set. Matheson and Tarjan (1996) proved that any n-vertex plane triangulation has a dominating set of size at most n/3, and conjectured a bound of n/4 for n sufficiently large.
Hong Liu, Michael J. Pelsmajer
openaire   +3 more sources

The human gut microbiome across the life course

open access: yesFEBS Letters, EarlyView.
Despite significant individual variation and continuous change throughout life, the human gut microbiome follows some life stage‐specific trends. This article provides a brief overview of how gut microbiome composition shifts across different phases of life. Created in BioRender. Özkurt, E. (2026) https://BioRender.com/8q4nrnc.
Alise J. Ponsero   +4 more
wiley   +1 more source

Dominating Sets in Planar Graphs

open access: yesEuropean Journal of Combinatorics, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lesley R. Matheson, Robert Endre Tarjan
openaire   +1 more source

Degradation mechanism of the von Willebrand factor A2 domain by nattokinase

open access: yesFEBS Letters, EarlyView.
Nattokinase, a natto‐derived protease, exhibits potent antithrombotic effects. This study demonstrates that nattokinase directly cleaves the von Willebrand factor (vWF) A2 domain in vitro. Unlike the native regulator ADAMTS13, nattokinase degrades folded vWF independently of shear stress.
Ryuichi Hyakumoto   +3 more
wiley   +1 more source

Dominating Set Knapsack: Profit Optimization on Dominating Sets

open access: yesCoRR
In a large-scale network, we want to choose some influential nodes to make a profit by paying some cost within a limited budget so that we do not have to spend more budget on some nodes adjacent to the chosen nodes; our problem is the graph-theoretic representation of it. We define our problem, Dominating Set Knapsack, by attaching the knapsack problem
openaire   +2 more sources

Modulation of Homer1 EVH1 domain internal dynamics by putative autism‐associated mutations

open access: yesFEBS Letters, EarlyView.
The putative autism‐associated M65I and S97L variants of the EVH1 domain of the postsynaptic scaffold protein Homer1 do not exhibit substantial changes in their overall structure or partner binding. Both of them, but especially the M65I variant, show altered internal dynamics relative to the wild‐type domain on the μs‐ms timescale, indicated by the ...
Fanni Farkas   +6 more
wiley   +1 more source

The pyruvate generator is a common phenomenon in mitochondria from different rat and mouse brain regions

open access: yesFEBS Letters, EarlyView.
The pyruvate generator, which causes activation of respiration by extra‐mitochondrial Ca2+, is also present and functional in rat brainstem mitochondria, as it is in other brain regions. This finding is confirmed by experiments with a fully reconstituted malate–aspartate shuttle (MAS).
Grazyna Debska‐Vielhaber   +7 more
wiley   +1 more source

Image Segmentation by Dominant Sets

open access: yesElectronic Notes in Discrete Mathematics, 2003
Abstract We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitive concept of a cluster and that of a dominant set of vertices, a novel notion that generalizes that of a maximal complete subgraph to edge-weighted graphs.
PAVAN M, PELILLO, Marcello
openaire   +2 more sources

The ubiquitin‐proteasome system and autophagy as guardians of the cellular proteome

open access: yesFEBS Letters, EarlyView.
This Perspective covers the three principles governing the crosstalk between the ubiquitin‐proteasome system and autophagy in cellular proteostasis: (1) a shared ubiquitin code routing substrates via shuttle factors or autophagy receptors; (2) spatial compartmentalization into phase‐separated degradation hubs and organelle‐specific modules (exemplified
Ivan Dikic
wiley   +1 more source

On the strong dominating sets of graphs

open access: yes, 2023
Summary: Let \(G=(V(G), E(G))\) be a simple graph. A set \(D\subseteq V(G)\) is a strong dominating set of \(G\), if for every vertex \(x\in V(G)\setminus D\) there is a vertex \(y\in D\) with \(xy\in E(G)\) and \(\deg(x)\leq \deg(y)\). The strong domination number \(\gamma_{\mathrm{st}}(G)\) is defined as the minimum cardinality of a strong dominating
Zaherifar, Hassan   +2 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy