Results 121 to 130 of about 6,626,501 (294)
Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley +1 more source
On equitable total coloring of snarks
Isabel F. A. Gonçalves +2 more
openaire +2 more sources
2-distance vertex-distinguishing total coloring of graphs
A [Formula: see text]-distance vertex-distinguishing total coloring of a graph [Formula: see text] is a proper total coloring of [Formula: see text] such that any pair of vertices at distance [Formula: see text] have distinct sets of colors.
Weifan Wang, Yafang Hu
core +1 more source
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
On the [r, s, t]-coloring of the square of cylindrical grids [PDF]
Brice Effantin
doaj +1 more source
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
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
On the equitable total (+1)-coloring of -regular graphs [PDF]
A graph is considered to be totally colored when one color is assigned to each vertex and to each edge so that no adjacent or incident vertices or edges bear the same color.
Stemock, Bryson
core
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
In this paper, we introduce a new concept in graph coloring, namely the \textit{packing total coloring}, which extends the idea of packing coloring to both the vertices and the edges of a given graph. More precisely, for a graph $G$, a packing total coloring is a mapping $c: V(G) \cup E(G) \rightarrow \{1, 2, \ldots\}$ with the property that for any ...
Ferme, Jasmina, Štesl, Daša Mesarič
openaire +2 more sources
Total coloring of certain double vertex graphs
In this paper we investigate the total coloring number for double vertex graphs of some of the most common classes of ...
Dundar P., Yorgancioglu Z.
core

