Results 111 to 120 of about 709,702 (295)
Infinite graphs with finite dominating sets
, 2017 In this paper, we study the infinite graphs which admit a finite dominating set. The main contribution of the work is two folds: (i) characterization of infinite trees and hence infinite connected graphs with a finite dominating set, (ii) it is shown ...
Angsuman Das
core +1 more source
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 +3 more
wiley +1 more source
Distance-Transitivity in Infinite Graphs
Journal of Combinatorial Theory, Series B, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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 +8 more
wiley +1 more source
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
A Note on Pseudofinite Acyclic Graphs
Известия Иркутского государственного университета: Серия "Математика"Acyclic graphs approximated by finite acyclic graphs are considered. It is proved that any countably categorical acyclic graph is smoothly approximable. An example of pseudofinite acyclic graph theory is given, which has an even, odd, and infinite number
N. D. Markhabatov, Ye. R. Baissalov
doaj +1 more source
Optimizing photoactivation of PA‐mCherry for optical pooled CRISPR screens
FEBS Open Bio, EarlyView.Photoactivatable PA‐mCherry finds widespread use to optically tag individual cells. However, confocal 405 nm UV laser‐scanning (normal scan) is much less efficient than widefield UV illumination, limiting the use of PA‐mCherry on confocal instruments. We remedy this limitation by reporting that rapid and repeated confocal scanning with a low‐intensity,
Sravasti Mukherjee +3 more
wiley +1 more source
Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
Discussiones Mathematicae Graph Theory, 2014 The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered.
Katona Gyula Y. +2 more
doaj +1 more source
FEBS Open Bio, EarlyView.The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong +3 more
wiley +1 more source
Automorphisms of infinite Johnson graphs
Discrete Mathematics, 2013 We consider the {\it infinite Johnson graph} $J_{\infty}$ whose vertex set consists of all subsets $X\subset {\mathbb N}$ satisfying $|X|=|{\mathbb N}\setminus X|=\infty$ and whose edges are pairs of such subsets $X,Y$ satisfying $|X\setminus Y|=|Y\setminus X|=1$.
openaire +3 more sources