Results 61 to 70 of about 1,258,349 (257)

Domination Numbers of Amalgamations of Cycles at Connected Subgraphs

open access: yesJournal of Mathematics, 2022
A set S of vertices of a graph G is a dominating set of G if every vertex in VG is adjacent to some vertex in S. A minimum dominating set in a graph G is a dominating set of minimum cardinality.
Prakassawat Boonmee   +2 more
doaj   +1 more source

The Forcing Geodetic Cototal Domination Number of a Graph

open access: yesRatio Mathematica, 2022
Let  be a geodetic cototal domination set of . A subset  is called a forcing subset for  if  is the unique minimum geodetic cototal domination set containing . The minimum cardinality T is the forcing geodetic cototal domination number of S is denotedby ,
S L Sumi, V Mary Gleeta, J Befija Minnie
doaj   +1 more source

Connected Domination on Linear and Double Hexagonal Chains [PDF]

open access: yes, 2020
is the minimum cardinality taken over all connected domination sets of ...
Dr S Velammal, Devi, M Uma
core  

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 graphs for which the connected domination number is at most the total domination number. Discrete [PDF]

open access: yes, 2012
In this note we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number.
Oliver Schaudt
core  

New bound on MIS and MIN-CDS for a unit ball graph

open access: yesICT Express, 2017
The size of the maximum independent set (MIS) in a graph G is called the independence number. The size of the minimum connected dominating set (MIN-CDS) in G is called the connected domination number.
D.A. Mojdeh, M. Ghanbari, M. Ramezani
doaj   +1 more source

Structural and biochemical analysis of a B12 superbinder

open access: yesFEBS Letters, EarlyView.
BtuG proteins are vitamin B12 scavengers in Bacteroides thetaiotaomicron, a dominant human gut bacterium. We present crystal structures of three BtuG homologs bound to cobalamin and its precursor cobinamide, revealing picomolar binding affinities, among the highest known for any natural protein.
Jose M. Martinez Felices   +3 more
wiley   +1 more source

When the connected domination number is at most the total domination number [PDF]

open access: yes, 2011
In this note we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number.
Schaudt, Oliver
core  

RNA‐related functions of BRCA2 in transcription, replication, and genome stability

open access: yesFEBS Letters, EarlyView.
Beyond its role in homologous recombination, BRCA2 regulates R‐loop homeostasis, DNA–RNA hybrid resolution, RNA polymerase II dynamics, and transcriptional activation. Disruption of any of these functions can contribute to genome instability, inflammatory signaling, and tumorigenesis. BRCA2 is a central tumor suppressor protein best known for its roles
Lucia Alvaro‐Aranda   +2 more
wiley   +1 more source

Triple Connected Domination Number of Graph [PDF]

open access: yes, 2019
The concept of triple connected graphs with real life application was prefaced by considering the existence of a path containing any three vertices of a graph G.
B. Senthilkumar, P. Paramasivan
core  

Home - About - Disclaimer - Privacy