Results 91 to 100 of about 370,627 (270)

Divisible Design Graphs [PDF]

AMS Subject Classification: 05B05, 05E30, 05C50.Strongly regular graph;Group divisible design;Deza graph;(v;k ...
Haemers, W.H., Kharaghani, H., Meulenberg, M.A.   +2 more
core   +1 more source

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

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, Yelyzaveta Pulnova, Elke De Zitter, Helen M. Ginn, Briony A. Yorke   +4 more
wiley   +1 more source

Self-Dual and LCD Codes from Kneser Graphs K(n, 2) and Generalized Quadrangles

Mathematics
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

YIPFα1A expression is regulated by multilayered molecular mechanisms

FEBS Open Bio, EarlyView.
YIPFα1A, a five‐pass Golgi protein, is regulated at multiple layers. (1) Rare‐codon enrichment drives translation‐coupled mRNA decay. (2) A proximal 3′‐UTR element stabilizes mRNA. (3) A distal 3′‐UTR element included by alternate poly(A) site usage represses translation, which can be overridden by the proximal 3′‐UTR element.
Tokio Takaji, Yurika Nakanishi, Nobuhiro Nakamura   +2 more
wiley   +1 more source

A matrix representation of graphs and its spectrum as a graph invariant

, 2006
We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the first two cases,
Emms, David, Hancock, Edwin R., Severini, Simone, Wilson, Richard C.   +3 more
core   +2 more sources

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, Giulia Zanetti, Bram van den Broek, Kees Jalink   +3 more
wiley   +1 more source

Strongly Regular Graphs with Maximal Energy [PDF]

The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Koolen and Moulton have proved that the energy of a graph on n vertices is at most n(1 + √n)/2, and that equality holds if and only if the graph is ...
Haemers, W.H.
core   +1 more source

Some New Cyclotomic Strongly Regular Graphs [PDF]

Journal of Algebraic Combinatorics, 1995
Given a field \(F\) and a subset \(D\) of \(F^*\) such that \(D= -D\), one can define a graph \(\Gamma\) with vertex set \(F\) by letting \(x\sim y\) whenever \(y- x\in D\). Several authors have studied the problem of finding sets \(D\) such that the graph \(\Gamma\) is strongly regular and many examples are known.
openaire   +2 more sources

Cyclic azapeptide CD36 ligand attenuates cardiac injury and reduces long‐chain fatty acid accumulation after myocardial ischemia–reperfusion in mice

FEBS Open Bio, EarlyView.
In a murine model of myocardial ischemia and reperfusion (MI/R), the CD36 azapeptide ligand MPE‐298 reduces cardiac injury and transiently lowers left ventricular long‐chain fatty acids (LCFAs) accumulation 3 h after reperfusion, accompanied by a decrease of oxidative stress and inflammation‐associated genes' expression in the heart and adipose tissue.
Jade Gauvin, Naghme Radmannia, David N. Huynh, Liliane Ménard, Caroline Daneault, Maïté Veilleux, Ahsanullah Ahsanullah, André C. Carpentier, William D. Lubell, Matthieu Ruiz, Huy Ong, Sylvie Marleau, Simon‐Pierre Gravel   +12 more
wiley   +1 more source

q-analogs of strongly regular graphs

Linear Algebra and its Applications
We introduce the notion of q-analogs of strongly regular graphs and give several examples of such structures. We prove a necessary condition on the parameters, show the connection to designs over finite fields, and present a classification.
Michael Braun, Dean Crnković, Maarten De Boeck, Vedrana Mikulić Crnković, Andrea Švob   +4 more
openaire   +3 more sources