Results 101 to 110 of about 2,798,542 (296)
Graphs with Few Eigenvalues. An Interplay between Combinatorics and Algebra. [PDF]
: Two standard matrix representations of a graph are the adjacency matrix and the Laplace matrix. The eigenvalues of these matrices are interesting parameters of the graph.
Dam, E.R. van
core
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
Transitive combinatorial structures invariant under some subgroups of S(6,2) and related codes
In this paper we define combinatorial structures on the conjugacy classes of the maximal subgroups of the symplectic group S(6,2) under the action of two subgroups of S(6,2) isomorphic to U(3,3) or U(4,2).
Dean Crnković +2 more
doaj +1 more source
Strongly regular graphs induced by polarities of symmetric designs [PDF]
Graphs ...
Higman, D.G. +2 more
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
Self-Dual and LCD Codes from Kneser Graphs K(n, 2) and Generalized Quadrangles
In this paper, we study self-dual and LCD codes constructed from Kneser graphs K(n, 2) and collinearity graphs of generalized quadrangles using the so-called pure and bordered construction. We determine conditions under which these codes are self-dual or
Dean Crnković, Ana Grbac
doaj +1 more source
A generalization of Ding’s construction is proposed that employs as a defining set the collection of the sth powers ( s ≥ 2 ) of all nonzero elements in G F ( p m ) , where p ≥ 2 is prime.
Dean Crnković +2 more
doaj +1 more source
Some Implications on Amorphic Association Schemes [PDF]
AMS classifications: 05E30, 05B20;amorphic association scheme;strongly regular graph;(negative) Latin square type;cyclotomic association scheme;strongly regular ...
Dam, E.R. van, Muzychuk, M.
core
Optimizing photoactivation of PA‐mCherry for optical pooled CRISPR screens
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
Network motifs are patterns of complex networks occurring significantly more frequently than those in random networks. They have been considered as fundamental building blocks of complex networks.
Jialu Hu, Xuequn Shang
doaj +1 more source

