Results 101 to 110 of about 9,176,317 (295)

Perfect secure domination in graphs [PDF]

open access: yesCategories and General Algebraic Structures with Applications, 2017
Let $G=(V,E)$ be a graph. A subset $S$ of $V$ is a dominating set of $G$ if every vertex in $Vsetminus  S$ is adjacent to a vertex in $S.$ A dominating set $S$ is called a secure dominating set if for each $vin Vsetminus S$ there exists $uin S$ such that
S.V. Divya Rashmi   +3 more
doaj  

Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation

open access: yesFEBS 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

Computation of Various Domination Numbers of Rolf Nevanlinna (RNP) Collaboration Graph

open access: yesBrazilian Archives of Biology and Technology, 2017
In this paper, we compute various Domination numbers like Outer Connected Domination (OCD), Doubly Connected Domination (DCD), Fair Domination (FD), Independence Domination (ID), 2-Packing (2-P) for Rolf Nevanlinna Prize Winners's Collaboration Graph ...
Yegnanarayanan V, Logeshwary B
doaj   +1 more source

Domination numbers and homology

open access: yesJournal of Combinatorial Theory, Series A, 2003
Certain homological properties of the independence complex of a graph, which is a simplicial complex on the vertex set of the graph whose simplices are all independent subsets of the vertex set, are studied, as well as their connection with domination numbers. As application Hall-type theorems for colored independent sets are proved.
openaire   +3 more sources

The microbiome in human skin aging

open access: yesFEBS Letters, EarlyView.
Age‐related skin changes encompass the well‐known visible phenotypic alterations, together with microbiome dysbiosis and a series of molecular aging hallmarks. These hallmarks characterize not only a fully stablished aged phenotype but also the skin aging process itself.
Manuel Huerta Arana   +3 more
wiley   +1 more source

A note on the independent domination number versus the domination number in bipartite graphs [PDF]

open access: yesCzechoslovak Mathematical Journal, 2017
Accepted by Czechoslovak Mathematical ...
Wang, Shaohui, Wei, Bing
openaire   +2 more sources

Autophagy and mitophagy in pancreatic β‐cell homeostasis and their involvement in diabetes pathophysiology

open access: yesFEBS Letters, EarlyView.
This review focuses on the role of autophagy and mitophagy in maintaining pancreatic β‐cell function and homeostasis. We discuss how genetic defects affecting these pathways contribute to the development of type 1, type 2, monogenic, and gestational diabetes. We further explore their potential as therapeutic targets. Created in BioRender.
Yunkyeong Lee   +2 more
wiley   +1 more source

On the (2,2)-domination number of trees [PDF]

open access: yes, 2010
Let γ(G) and $γ_{2,2}(G)$ denote the domination number and (2,2)-domination number of a graph G, respectively. In this paper, for any nontrivial tree T, we show that $(2(γ(T)+1))/3 ≤ γ_{2,2}(T) ≤ 2γ(T)$.
Hou, Xinmin, Xu, Jun-Ming, Lu, You
core   +1 more source

Partial depletion of plasminogen activator inhibitor‐1 decreases subcutaneous fat cell hypertrophy and liver cholesterol in high‐fat‐fed female mice

open access: yesFEBS Letters, EarlyView.
Obesity raises blood levels of PAI‐1, a protein linked to metabolic dysfunction‐associated steatotic liver disease in people with obesity. In female mice fed a high‐fat diet, partially lowering PAI‐1 led to smaller subcutaneous fat cells and lower liver cholesterol, without changing body weight or insulin sensitivity.
Claudia E. Ramirez Bustamante   +10 more
wiley   +1 more source

Independent [1,2]-number versus independent domination number

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2017
A [1; 2]-set S in a graph G is a vertex subset such that every vertex not in S has at least one and at most two neighbors in it. If the additional requirement that the set be independent is added, the existence of such sets is not guaranteed in every ...
Aleid Sahar A.   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy