Results 91 to 100 of about 11,106,432 (291)
Independent domination in graphs [PDF]
, 2018 V magistrskem delu obravnavamo različne tipe dominacij in sicer dominantno število, neodvisnostno število, neodvisno dominantno število in zgornje dominantno število.
Črešnjevec, Nina
core
مجلة بغداد للعلوم, 2019 The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination.
Omran et al.
doaj +1 more source
On the independence transversal total domination number of graphs
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abel Cabrera Martínez +2 more
openaire +2 more sources
Peripheral lysosomes recruit PLEKHG3 to focal adhesions and restrain protrusion dynamics
FEBS Letters, EarlyView.Proximity‐dependent labeling at the LAMTOR complex revealed the Rho GEF PLEKHG3 as a lysosome‐proximal protein directing the study toward the influence of lysosome positioning on actin dynamics and cell motility. We show that PLEKHG3 colocalizes with lysosomes at focal adhesion sites and observe that forced peripheral dispersion of lysosomes hinders ...
Rainer Ettelt +8 more
wiley +1 more source
2-Outer-Independent Domination in Graphs [PDF]
, 2015 We initiate the study of 2-outer-independent domination in graphs. A 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V (G) \D has at least two neighbors in D, and the set V (G)\D is independent. The 2-
Nader Jafari Rad, Marcin Krzywkowski
core +1 more source
Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation
FEBS Letters, EarlyView.Peptides and antibodies occupy complementary therapeutic niches. Peptides recognize difficult targets in a compact format, while antibodies add specificity, long half‐life, and effector functions. This review examines strategies that merge both modalities—peptide grafting into loops, terminal and Fc fusions, and bioconjugation—highlighting how ...
Jinling Wang +2 more
wiley +1 more source
Product throttling for power domination [PDF]
, 2020 The product power throttling number of a graph is defined to study product throttling for power domination. The domination number of a graph is an upper bound for its product power throttling number.
Trenk, Ann +6 more
core
Independent k-rainbow bondage number of graphs
AKCE International Journal of Graphs and CombinatoricsFor an integer [Formula: see text] an independent k-rainbow dominating function (IkRDF for short) on a graph G is a function g that assigns to each vertex a set of colors chosen from the subsets of [Formula: see text] satisfying the following conditions:
S. Kosari +4 more
doaj +1 more source
Outer-Independent Italian Domination in Graphs
IEEE Access, 2019 An outer-independent Italian dominating function (OIIDF) on a graph G with vertex set V(G) is defined as a function f : V(G) → {0, 1, 2}, such that every vertex v ∈ V(G) with f(v) = 0 has at least two neighbors assigned 1 under f or one ...
Wenjie Fan +5 more
doaj +1 more source
Epigenetic reprogramming of lineage switching in cancer
FEBS Letters, EarlyView.Cancer cells rarely commit to a single identity. Epigenetic mechanisms and tumor microenvironment cues push epithelial cells toward flexible, hybrid states that can shift into mesenchymal, neuroendocrine, or stem‐like fates, driving metastasis, drug resistance, and tumor heterogeneity. Targeting the epigenetic regulators behind these transitions, using
Ezgi Boyvatlı +4 more
wiley +1 more source