Results 71 to 80 of about 9,917,456 (366)
Population Ecology, EarlyView.Population size and dynamics fundamentally shape speciation by influencing genetic drift, founder events, and adaptive potential. Small populations may speciate rapidly due to stronger drift, whereas large populations harbor more genetic diversity, which can alter divergence trajectories. We highlight theoretical models that incorporate population size
Ryo Yamaguchi +3 more
wiley +1 more source
AIMS Mathematics, 2023 Let $ G = (V, E) $ be a simple graph with vertex set $ V $ and edge set $ E $, and let $ f $ be a function $ f:V\mapsto \{0, 1, 2\} $. A vertex $ u $ with $ f(u) = 0 $ is said to be undefended with respect to $ f $ if it is not adjacent to a vertex with ...
Jian Yang, Yuefen Chen, Zhiqiang Li
doaj +1 more source
On the domination number of a graph
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
FEBS Letters, EarlyView.Exposure to common noxious agents (1), including allergens, pollutants, and micro‐nanoplastics, can cause epithelial barrier damage (2) in our body's protective linings. This may trigger an immune response to our microbiome (3). The epithelial barrier theory explains how this process can lead to chronic noncommunicable diseases (4) affecting organs ...
Can Zeyneloglu +17 more
wiley +1 more source
Bounds on the Locating Roman Domination Number in Trees
Discussiones Mathematicae Graph Theory, 2018 A Roman dominating function (or just RDF) on a graph G = (V, E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of an RDF f is the value f(
Jafari Rad Nader, Rahbani Hadi
doaj +1 more source
Changing and Unchanging of the Domination Number of a Graph: Path Addition Numbers [PDF]
Discussiones Mathematicae Graph Theory, 2018 Given a graph G =(V, E) and two its distinct vertices u and v, the (u, v)-Pk-addition graph of G is the graph Gu,v,k−2 obtained from disjoint union of G and a path Pk : x0, x1,...,xk−1, k ≥ 2, by identifying the vertices u and x0, and identifying the ...
V. Samodivkin
semanticscholar +1 more source
From omics to AI—mapping the pathogenic pathways in type 2 diabetes
FEBS Letters, EarlyView.Integrating multi‐omics data with AI‐based modelling (unsupervised and supervised machine learning) identify optimal patient clusters, informing AI‐driven accurate risk stratification. Digital twins simulate individual trajectories in real time, guiding precision medicine by matching patients to targeted therapies.
Siobhán O'Sullivan +2 more
wiley +1 more source
Some Results on the Strong Roman Domination Number of Graphs [PDF]
Mathematics Interdisciplinary Research, 2020 Let G=(V,E) be a finite and simple graph of order n and maximum degree Δ(G). A strong Roman dominating function on a graph G is a function f:V (G)→{0, 1,… ,[Δ(G)/2 ]+ 1} satisfying the condition that every vertex v for which f(v)=0 is
Akram Mahmoodi +2 more
doaj +1 more source
ERBIN limits epithelial cell plasticity via suppression of TGF‐β signaling
FEBS Letters, EarlyView.In breast and lung cancer patients, low ERBIN expression correlates with poor clinical outcomes. Here, we show that ERBIN inhibits TGF‐β‐induced epithelial‐to‐mesenchymal transition in NMuMG breast and A549 lung adenocarcinoma cell lines. ERBIN suppresses TGF‐β/SMAD signaling and reduces TGF‐β‐induced ERK phosphorylation.
Chao Li +3 more
wiley +1 more source
Split Legendary Domination in graphs
Ratio MathematicaHarary and Norman introduced the line graph L(G) . We introduced the legendary domination number by combining the domination concept both in graph and its line graph.
P. Kavitha
doaj +1 more source