Results 111 to 120 of about 945,213 (292)
On powers of m-trapezoid graphs
The author introduces \(m\)-trapezoid graphs (\(m\)-TGs) as intersection graphs of \(m\)-trapezoids, where an \(m\)-trapezoid is given by \(m+ 1\) intervals on \(m+ 1\) parallel lines. (The class of 0-TGs is the class of interval graphs.) The main result concerns powers of graphs: If \(G^{k- 1}\) is an \(m\)-TG then \(G^k\) is also an \(m\)-TG.
openaire +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
The rise of wireless devices makes interference a key challenge for reliable communication in dense spectrum-sharing networks. This paper proposes a graph neural network (GNN)-based power control algorithm to minimize the worst-case outage probability by
Liang Han, Xiaosen Shi, Tingting Lu
doaj +1 more source
The Distinguishing Number and Distinguishing Index of the Lexicographic Product of Two Graphs
The distinguishing number (index) D(G) (D′(G)) of a graph G is the least integer d such that G has a vertex labeling (edge labeling) with d labels that is preserved only by the trivial automorphism.
Alikhani Saeid, Soltani Samaneh
doaj +1 more source
Measure preserving homomorphisms and independent sets in tensor graph powers [PDF]
In this note, we study the behavior of independent sets of maximum probability measure in tensor graph powers. To do this, we introduce an upper bound using measure preserving homomorphisms. This work extends some previous results concerning independence
Hatami, Pooya +3 more
core +1 more source
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
On The Eigenvalue Distribution Of Adjacency Matrices For Connected Planar Graphs
This paper describes the previously unknown statistical distribution of adjacency matrix spectra for planar graphs, also known as spatial weights matrices, in terms of the following three readily available eigenvalue properties: extremes, rank orderings,
Griffith Daniel A.
doaj +1 more source
Euclidean Jordan algebras and some conditions over the spectra of a strongly regular graph
Let G be a primitive strongly regular graph G such that the regularity is less than half of the order of G and A its matrix of adjacency, and let 𝒜 be the real Euclidean Jordan algebra of real symmetric matrices of order n spanned by the identity matrix ...
Vieira Luís
doaj +1 more source
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
In the fifth generation (5G) era, dense deployment of small cells and full-duplex (FD) technology applications are two key features of millimeter-wave (mmWave) wireless communication systems, which offer the opportunity to meet the explosive growth of ...
Jing Li +5 more
doaj +1 more source

