Results 41 to 50 of about 669,922 (254)

Metric dimension of fullerene graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2019
A resolving set W is a set of vertices of a graph G(V, E) such that for every pair of distinct vertices u, v ∈ V(G), there exists a vertex w ∈ W satisfying d(u, w) ≠ d(v, w).
Shehnaz Akhter, Rashid Farooq
doaj   +1 more source

The metric dimension and metric independence of a graph [PDF]

open access: yes, 2001
A vertex x of a graph G resolves two vertices u and v of G if the distance from x to u does not equal the distance from x to v. A set S of vertices of G is a resolving set for G if every two distinct vertices of G are resolved by some vertex of S. The
Currie, James, Oellerman, Ortrud R.
core  

Thermostable neutral metalloprotease from Geobacillus sp. EA1 does not share thermolysin's preference for substrates with leucine at the P1′ position

open access: yesFEBS Letters, EarlyView.
Knowing how proteases recognise preferred substrates facilitates matching proteases to applications. The S1′ pocket of protease EA1 directs cleavage to the N‐terminal side of hydrophobic residues, particularly leucine. The S1′ pocket of thermolysin differs from EA's at only one position (leucine in place of phenylalanine), which decreases cleavage ...
Grant R. Broomfield   +3 more
wiley   +1 more source

Entropy dimension of measure preserving systems

open access: yes, 2018
The notion of metric entropy dimension is introduced to measure the complexity of entropy zero dynamical systems. For measure preserving systems, we define entropy dimension via the dimension of entropy generating sequences.
Dou, Dou, Huang, Wen, Park, Kyewon Koh
core   +1 more source

Microbial exopolysaccharide production by polyextremophiles in the adaptation to multiple extremes

open access: yesFEBS Letters, EarlyView.
Polyextremophiles are microorganisms that endure multiple extreme conditions by various adaptation strategies that also include the production of exopolysaccharides (EPSs). This review provides an integrated perspective on EPS biosynthesis, function, and regulation in these organisms, emphasizing their critical role in survival and highlighting their ...
Tracey M Gloster, Ebru Toksoy Öner
wiley   +1 more source

Double resolvability parameters of fosmidomycin anti-malaria drug and exchange property

open access: yesHeliyon
The 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

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

On the metric dimension and fractional metric dimension for hierarchical product of graphs

open access: yes, 2012
A set of vertices $W$ {\em resolves} a graph $G$ if every vertex of $G$ is uniquely determined by its vector of distances to the vertices in $W$. The {\em metric dimension} for $G$, denoted by $\dim(G)$, is the minimum cardinality of a resolving set of ...
Feng, Min, Wang, Kaishun
core   +1 more source

Single cis‐elements in brassinosteroid‐induced upregulated genes are insufficient to recruit both redox states of the BIL1/BZR1 DNA‐binding domain

open access: yesFEBS Letters, EarlyView.
Phytohormone brassinosteroid‐induced gene regulation by the transcription factor BIL1/BZR1 involves redox‐dependent DNA‐binding alternation and interaction with the transcription factor PIF4. The reduced BIL1/BZR1 dimer binds preferred cis‐elements, while oxidation alters its oligomerization state and disrupts DNA‐binding ability.
Shohei Nosaki   +4 more
wiley   +1 more source

Metric Dimension Parameterized by Max Leaf Number

open access: yes, 2015
The metric dimension of a graph is the size of the smallest set of vertices whose distances distinguish all pairs of vertices in the graph. We show that this graph invariant may be calculated by an algorithm whose running time is linear in the input ...
Eppstein, David
core   +1 more source

Home - About - Disclaimer - Privacy