Results 51 to 60 of about 680,163 (298)
The Dominant Metric Dimension of Corona Product Graphs
مجلة بغداد للعلوم, 2021 The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations.
Rembulan Putri Adirasari +2 more
doaj +1 more source
The IQ‐compete assay for measuring mitochondrial protein import efficiencies in living yeast cells
FEBS Letters, EarlyView.The efficiency of mitochondrial protein import depends on the properties of the newly synthesized precursor proteins. The Import and de‐Quenching Competition (IQ‐compete) assay is a novel method to monitor the import efficiency of different proteins by fluorescence in living yeast cells.
Yasmin Hoffman +3 more
wiley +1 more source
On the metric dimension of imprimitive distance-regular graphs
, 2016 A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$.
Bailey, Robert F.
core +1 more source
By dawn or dusk—how circadian timing rewrites bacterial infection outcomes
FEBS Letters, EarlyView.The circadian clock shapes immune function, yet its influence on infection outcomes is only beginning to be understood. This review highlights how circadian timing alters host responses to the bacterial pathogens Salmonella enterica, Listeria monocytogenes, and Streptococcus pneumoniae revealing that the effectiveness of immune defense depends not only
Devons Mo +2 more
wiley +1 more source
Metric Mean Dimension for Algebraic Actions of Sofic Groups [PDF]
, 2015 Recently Bingbing Liang and Hanfeng Li computed the mean dimension and metric mean dimension for algebraic actions of amenable groups. We show how to extend their computation of metric mean dimension to the case of sofic groups, provided that the dual ...
Hayes, Ben
core
Fault-Tolerant Metric Dimension of Circulant Graphs
Mathematics, 2022 Let G be a connected graph with vertex set V(G) and d(u,v) be the distance between the vertices u and v. A set of vertices S={s1,s2,…,sk}⊂V(G) is called a resolving set for G if, for any two distinct vertices u,v∈V(G), there is a vertex si∈S such that d ...
Laxman Saha +4 more
doaj +1 more source
On the Metric Dimension of Infinite Graphs [PDF]
Electronic Notes in Discrete Mathematics, 2009 A set of vertices $S$ \emph{resolves} a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of a graph $G$ is the minimum cardinality of a resolving set. In this paper we study the metric dimension of infinite graphs such that all its vertices have finite degree.
Cáceres, José +4 more
openaire +6 more sources
FEBS Letters, EarlyView.PARP‐1 is a key enzyme in the DNA damage response, and its inhibition induces cancer cell death via synthetic lethality. Au(I)‐based drugs, such as aurothioglucose and sodium aurothiomalate, block PARP‐1's DNA‐dependent activity by targeting its zinc finger domains.
Uliana Bashtanova, Melinda Jane Duer
wiley +1 more source
Double resolvability parameters of fosmidomycin anti-malaria drug and exchange property
HeliyonThe practical and theoretical significance of the resolvability parameter makes it an important factor, particularly in the context of network analysis.
Rashad Ismail +3 more
doaj +1 more source
Metric dimension of generalized wheels
Arab Journal of Mathematical Sciences, 2019 In a graph G, a vertex w∈V(G)resolves a pair of vertices u,v∈V(G)if d(u,w)≠d(v,w). A resolving set of G is a set of vertices S such that every pair of distinct vertices in V(G)is resolved by some vertex in S.
Badekara Sooryanarayana +2 more
doaj +1 more source