Results 111 to 120 of about 22,588 (272)
Fault-Tolerant Metric Dimension and Applications: Zero-Divisor Graph of Upper Triangular Matrices
MathematicsGraph invariants play a crucial role in understanding the structural and combinatorial characteristics of graphs. The fault-tolerant metric dimension, as a significant graph invariant, finds applications in diverse areas such as robust network ...
Latif Abdelmalek Hanna +2 more
doaj +1 more source
On the edge metric dimension for the random graph
, 2016 Let $G(V, E)$ be a connected simple undirected graph. In this paper we prove that the edge metric dimension (introduced by Kelenc, Tratnik and Yero) of the Erdős-Rényi random graph $G(n, p)$ is given by: $$\textrm{edim}(G(n, p)) = (1 + o(1))\frac{4\log(n)}{\log(1/q)},$$ where $q = 1 - 2p(1-p)^2(2-p)$.
openaire +2 more sources
FEBS Open Bio, EarlyView.This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
An efficient way to represent the processors and their connections in omega networks
Ain Shams Engineering JournalThe understanding of the structure of a network can be enhanced efficiently with distance-reliant parameters. The metric dimension is one such parameter with numerous variations and a rich source of literature.
Savari Prabhu +2 more
doaj +1 more source
FEBS Open Bio, EarlyView.Matrix metalloproteinase‐9 (MMP9) drives ovarian cancer progression. Using MMP9‐null cells (M9‐KO) created from ovarian cancer cells, we found MMP9 loss did not block Epidermal Growth Factor (EGF)‐driven E‐cadherin dissolution or EMT but delayed and reduced EGF‐driven membrane protrusions. Transient MMP9 re‐expression drove membrane protrusion.
Claire Strauel +8 more
wiley +1 more source
Metric dimension and diameter of graphs
, 2020 : A graph G = (V, E) is a non-empty collection of vertices and edges, where V is the vertex set, E the edge set and |V (G)| is the order of a graph. The diameter, D, of a graph is the maximum distance between any two vertices.
Rivett-Carnac, Emily J.
core
Evolutionarily divergent DUF4465 domains have a common vitamin B12‐binding function
FEBS Open Bio, EarlyView.We show that DUF4465 family proteins, widespread across bacteria from gut microbiomes, hydrothermal vents, and soil, share a common vitamin B12‐binding function. These augmented β‐jellyroll proteins bind vitamin B12 via extended loops. Our findings establish sequence‐diverse DUF4465 proteins as a widespread class of B12‐binding proteins, highlighting ...
Charlea Clarke +4 more
wiley +1 more source
Configuration spaces of thick particles on graphs [PDF]
, 2011 In this thesis, we study the topology of configuration spaces of particles of variable radius r>0 moving on a metric graph. Our main tool is a piecewise linear (PL) Morse-Bott theory for affine polytope complexes, which extends the Morse theory for such ...
DEELEY, KENNETH
core
FEBS Open Bio, EarlyView.Activation of the mitochondrial protein OXR1 increases pSyn129 αSynuclein aggregation by lowering ATP levels and altering mitochondrial membrane potential, particularly in response to MSA‐derived fibrils. In contrast, ablation of the ER protein EMC4 enhances autophagic flux and lysosomal clearance, broadly reducing α‐synuclein aggregates.
Sandesh Neupane +11 more
wiley +1 more source
On the vertices belonging to all edge metric bases
An edge metric basis of a connected graph G is a smallest possible set of vertices S of G satisfying the following: for any two edges e, f of G there is a vertex s ∈ S such that the distances from s to e and f differ.
González Yero, Ismael +3 more
core +1 more source