Strong resolving graphs: The realization and the characterization problems
Discrete Applied Mathematics, 2018 arXiv admin note: text overlap with arXiv:1508 ...
Dorota Kuziak +3 more
openaire +4 more sources
Observer Placement for Source Localization: The Effect of Budgets and Transmission Variance [PDF]
, 2016 When an epidemic spreads in a network, a key question is where was its source, i.e., the node that started the epidemic. If we know the time at which various nodes were infected, we can attempt to use this information in order to identify the source ...
Celis, L. Elisa +2 more
core +2 more sources
Stabbing line segments with disks: complexity and approximation algorithms [PDF]
, 2017 Computational complexity and approximation algorithms are reported for a problem of stabbing a set of straight line segments with the least cardinality set of disks of fixed radii $r>0$ where the set of segments forms a straight line drawing $G=(V,E)$ of
Kobylkin, Konstantin
core +1 more source
Strong resolving partitions for strong product graphs and Cartesian product graphs
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
FEBS Letters, EarlyView.We identified a systemic, progressive loss of protein S‐glutathionylation—detected by nonreducing western blotting—alongside dysregulation of glutathione‐cycle enzymes in both neuronal and peripheral tissues of Taiwanese SMA mice. These alterations were partially rescued by SMN antisense oligonucleotide therapy, revealing persistent redox imbalance as ...
Sofia Vrettou, Brunhilde Wirth
wiley +1 more source
On the strong metric dimension of crossed prism graph and edge corona of cycle with path graph
Journal of Physics: Conference Series, 2019 Let G be a connected graph with vertex set V(G) and edge set E(G). The interval I[u, v] between u and v is defined as the collection of all vertices that belong to some shortest u − v path.
Astri Yunitasari, Tri Atmojo Kusmayadi
semanticscholar +1 more source
On the strong partition dimension of graphs [PDF]
, 2013 We present a different way to obtain generators of metric spaces having the property that the ``position'' of every element of the space is uniquely determined by the distances from the elements of the generators.
Yero, Ismael Gonzalez
core
YAP1::TFE3 mediates endothelial‐to‐mesenchymal plasticity in epithelioid hemangioendothelioma
Molecular Oncology, EarlyView.The YAP1::TFE3 fusion protein drives endothelial‐to‐mesenchymal transition (EndMT) plasticity, resulting in the loss of endothelial characteristics and gain of mesenchymal‐like properties, including resistance to anoikis, increased migratory capacity, and loss of contact growth inhibition in endothelial cells.
Ant Murphy +9 more
wiley +1 more source
Modeling hepatic fibrosis in TP53 knockout iPSC‐derived human liver organoids
Molecular Oncology, EarlyView.This study developed iPSC‐derived human liver organoids with TP53 gene knockout to model human liver fibrosis. These organoids showed elevated myofibroblast activation, early disease markers, and advanced fibrotic hallmarks. The use of profibrotic differentiation medium further amplified the fibrotic signature seen in the organoids.
Mustafa Karabicici +8 more
wiley +1 more source
A Comparison between the Metric Dimension and Zero Forcing Number of Trees and Unicyclic Graphs
, 2017 The \emph{metric dimension} $\dim(G)$ of a graph $G$ is the minimum number of vertices such that every vertex of $G$ is uniquely determined by its vector of distances to the chosen vertices.
Eroh, Linda, Kang, Cong X., Yi, Eunjeong
core +1 more source