Results 81 to 90 of about 177,806 (308)

Some Resolving Parameters in a Class of Cayley Graphs

Journal of Mathematics, 2022
Resolving parameters are a fundamental area of combinatorics with applications not only to many branches of combinatorics but also to other sciences.
Jia-Bao Liu, Ali Zafari
doaj   +1 more source

Weakening the nuclear envelope: Lamin B receptor in melanoma metastasis

Molecular Oncology, EarlyView.
LBR‐driven nuclear fragility supports melanoma invasion. A: Melanocyte presents low LBR (Lamin B Receptor) levels, maintaining nuclear integrity and lamina‐chromatin tethering. B: During malignant progression, upregulation of LBR clusters at the INM (Inner Nuclear Membrane) during confined migration causes local lamina weakening and cholesterol ...
Francesca Lorenzini, Maria Caterina Mione   +1 more
wiley   +1 more source

On Wiener index of graph complements [PDF]

Transactions on Combinatorics, 2014
Let $G$ be an $(n,m)$-graph. We say that $G$ has property $(ast)$ if for every pair of its adjacent vertices $x$ and $y$, there exists a vertex $z$, such that $z$ is not adjacent to either $x$ or $y$.
Jaisankar Senbagamalar, Jayapal Baskar Babujee, Ivan Gutman   +2 more
doaj  

Patient therapy outcome modeling in cancer organoids is improved by cancer‐associated fibroblasts and organoid assembly convolution

Molecular Oncology, EarlyView.
Patient‐derived organoids (PDOs) from pancreatic, colorectal, and gastric cancers were used to evaluate standard and experimental therapies. Incorporating cancer‐associated fibroblasts (CAFs) into organoid cultures improved patient therapy outcome prediction.
Marcin Grochowski, Liudmyla Dolinchuk, Michał Jerzak, Albert Gandurski, Tomasz Grochowski, Weronika Wojtyś, Maciej Zadrożny, Wojciech Kaźmierczak, Małgorzata Lenarcik, Marta Matejak‐Górska, Radosław Samsel, Tomasz Olesiński, Dawid Walerych   +12 more
wiley   +1 more source

Universal distance domination in random graphs

Miskolc Mathematical Notes
Given a graph G=(V,E)D⊆VV∖DDGγ(G)GkDDdDk uk(G):= min ⁡ {d:∀ ⁡D⊆V with |D|≥d,D is a kdd set in G}.kuk(G)γ(G)=u1(G)ukkkkH ...
Gábor Bacsó, József Túri, Zsolt Tuza   +2 more
doaj   +1 more source

A light‐triggered Time‐Resolved X‐ray Solution Scattering (TR‐XSS) workflow with application to protein conformational dynamics

FEBS Open Bio, EarlyView.
Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei, Fredrik Orädd, Konstantinos Magkakis, Magnus Andersson   +3 more
wiley   +1 more source

On distance integral graphs

Discrete Mathematics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Milan Pokorný, Pavel Híc, Dragan Stevanovic, Marko Milosevic   +3 more
openaire   +3 more sources

Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies

FEBS Open Bio, EarlyView.
We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli, Mohammad Nour Alsamsam, Ugnė Bagdonaitė, Van Truc Vu, Chun‐Jen Huang, Polina Kuzhir, Mindaugas Zaremba, Aurimas Kopūstas, Marijonas Tutkus   +8 more
wiley   +1 more source

An embedding-based distance for temporal graphs

Nature Communications
Temporal graphs are commonly used to represent time-resolved relations between entities in many natural and artificial systems. Many techniques were devised to investigate the evolution of temporal graphs by comparing their state at different time points.
Lorenzo Dall’Amico, Alain Barrat, Ciro Cattuto   +2 more
doaj   +1 more source

Connectivity of distance graphs

Discrete Mathematics, 1992
Let \(K\supseteq\mathbb{Q}\) be a \(\mathbb{Z}\)-module and \(G\) a graph with a \(K\)- space as vertex set \(V\). If the edges of \(G\) are preserved under translations in \(V\) and \(G\) has more than one connected component, then the author shows that \(G\) has infinitely many components.
openaire   +2 more sources