Results 81 to 90 of about 7,194,939 (348)

Network topology drives population temporal variability in experimental habitat networks

open access: yesPopulation Ecology, EarlyView.
Habitat patches connected by dispersal pathways form habitat networks. We explored how network topology affects population outcomes in laboratory experiments using a model species (Daphnia carinata). Central habitat nodes in complex lattice networks exhibited lower temporal variability in population sizes, suggesting they support more stable ...
Yiwen Xu   +3 more
wiley   +1 more source

Augmenting graphs to partition their vertices into a total dominating set and an independent dominating set [PDF]

open access: yesOpuscula Mathematica
A graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. There exist infinite families of graphs that are not TI-graphs. We define the TI-augmentation number \(\operatorname{ti}(
Teresa W. Haynes, Michael A. Henning
doaj   +1 more source

occumb: An R package for site occupancy modeling of eDNA metabarcoding data

open access: yesPopulation Ecology, EarlyView.
This study introduces a new R package, occumb, for the convenient application of site occupancy modeling using environmental DNA (eDNA) metabarcoding data. We outline a data analysis workflow, including data setup, model fitting, model assessment, and comparison of potential study settings based on model predictions, all of which can be performed using
Keiichi Fukaya, Yuta Hasebe
wiley   +1 more source

Eternal Independent Sets in Graphs

open access: yesTheory and Applications of Graphs, 2016
The use of mobile guards to protect a graph has received much attention in the literature of late in the form of eternal dominating sets, eternal vertex covers and other models of graph protection.
Yair Caro, William Klostermeyer
doaj   +1 more source

On Locating-Dominating Set of Regular Graphs

open access: yesJournal of Mathematics, 2021
Let G be a simple, connected, and finite graph. For every vertex v∈VG, we denote by NGv the set of neighbours of v in G. The locating-dominating number of a graph G is defined as the minimum cardinality of W ⊆ VG such that every two distinct vertices u,v∈
Anuwar Kadir Abdul Gafur   +1 more
doaj   +1 more source

Leveraging current insights on IL‐10‐producing dendritic cells for developing effective immunotherapeutic approaches

open access: yesFEBS Letters, EarlyView.
In vivo IL‐10 produced by tissue‐resident tolDC is involved in maintaining/inducing tolerance. Depending on the agent used for ex vivo tolDC generation, cells acquire common features but prime T cells towards anergy, FOXP3+ Tregs, or Tr1 cells according to the levels of IL‐10 produced. Ex vivo‐induced tolDC were administered to patients to re‐establish/
Konstantina Morali   +3 more
wiley   +1 more source

Results on Relatively Prime Domination Number of Vertex Switching of Some Graphs

open access: yesRatio Mathematica, 2023
If a set S ⊆ V has at least two members and every pair of vertices u and v is such that (d(u), d(v)) = 1, then it is said to be a relatively prime dominating set.
A Jancy Vini, C Jayasekaran
doaj   +1 more source

Making tau amyloid models in vitro: a crucial and underestimated challenge

open access: yesFEBS Letters, EarlyView.
This review highlights the challenges of producing in vitro amyloid assemblies of the tau protein. We review how accurately the existing protocols mimic tau deposits found in the brain of patients affected with tauopathies. We discuss the important properties that should be considered when forming amyloids and the benchmarks that should be used to ...
Julien Broc, Clara Piersson, Yann Fichou
wiley   +1 more source

Bounds on the Locating-Domination Number and Differentiating-Total Domination Number in Trees

open access: yesDiscussiones Mathematicae Graph Theory, 2018
A subset S of vertices in a graph G = (V,E) is a dominating set of G if every vertex in V − S has a neighbor in S, and is a total dominating set if every vertex in V has a neighbor in S.
Rad Nader Jafari, Rahbani Hadi
doaj   +1 more source

Characterizing minimal point set dominating sets

open access: yesAKCE International Journal of Graphs and Combinatorics, 2016
A set D of vertices in a graph G=(V,E) is said to be a point-set dominating set (or, in short, psd-set) of G if for every subset S of V−D there exists a vertex v∈D such that the subgraph 〈S∪{v}〉 is connected; the set of all psd-sets of G will be denoted ...
Purnima Gupta, Rajesh Singh, S. Arumugam
doaj   +1 more source

Home - About - Disclaimer - Privacy