Results 81 to 90 of about 43,787 (293)
When an optimal dominating set with given constraints exists [PDF]
, 2019 International audienceA dominating set is a set S of vertices in a graph such that every vertex not in S is adjacent to a vertex in S. In this paper, we consider the set of all optimal (i.e.
Habib, Michel +10 more
core +1 more source
FEBS Letters, EarlyView.Embryo‐like structures (stembryos) are an innovative tool, but they are hindered by experimental variability and limited developmental potential. DNA methylation is crucial for mammalian development, but its status in stembryo models is poorly characterized.
Sara Canil +4 more
wiley +1 more source
Domination Parameters of a Graph and its Complement
Discussiones Mathematicae Graph Theory, 2018 A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G.
Desormeaux Wyatt J. +2 more
doaj +1 more source
The human gut microbiome across the life course
FEBS 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
In the complement of a dominating set [PDF]
, 2010 A set D of vertices of a graph G=(V,E) is a dominating set, if every vertex of D\V has at least one neighbor that belongs to D. The disjoint domination number of a graph G is the minimum cardinality of two disjoint dominating sets of G.
Löwenstein, Christian
core
Cubic Graphs with Total Domatic Number at Least Two
Discussiones Mathematicae Graph Theory, 2018 Let G be a graph with no isolated vertex. A total dominating set of G is a set S of vertices of G such that every vertex is adjacent to at least one vertex in S.
Akbari Saieed +3 more
doaj +1 more source
Degradation mechanism of the von Willebrand factor A2 domain by nattokinase
FEBS 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
The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations [PDF]
, 2019 International audienceThe problems of determining minimum identifying, locating-dominating, open locating-dominating or locating total-dominating codes in a graph G are variations of the classical minimum dominating set problem in G and are all known to ...
Lucarini, Yanina Paola +7 more
core +1 more source
Modulation of Homer1 EVH1 domain internal dynamics by putative autism‐associated mutations
FEBS 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
Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs [PDF]
, 2014 International audienceWe propose the first polynomial self-stabilizing distributed algorithm for the minimal total dominating set problem in an arbitrary graph.
Kheddouci, Hamamache +2 more
core +6 more sources