Results 101 to 110 of about 15,357 (262)
The Distinguishing Number and Distinguishing Index of the Lexicographic Product of Two Graphs
Discussiones Mathematicae Graph Theory, 2018 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
Comparative assessment of crystallographic and cryo‐EM models in the Protein Data Bank
FEBS Open Bio, EarlyView.Raw data obtained by X‐ray crystallography or cryo‐EM result in experimental maps, ultimately fitted by atomic models. Although the physical principles are different, the final results can be viewed, compared, and evaluated in the same way. With cryogenic electron microscopy (cryo‐EM) on track to surpass X‐ray crystallography as the preferred method ...
Alexander Wlodawer +7 more
wiley +1 more source
A Note on Short-Range Network Communication and Clustering
MathematicsComplex systems of interacting components often can be modeled by a graph that consists of a set of n nodes and a set of m edges. Such a graph can be represented by an adjacency matrix A∈Rn×n, whose (ij)th entry is one if there is an edge pointing from ...
Najaya Al-Hajri +3 more
doaj +1 more source
Euclidean Jordan algebras and some conditions over the spectra of a strongly regular graph
4 open, 2019 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
FEBS Open Bio, EarlyView.Human ABCE1 cannot functionally replace its yeast ortholog. Yeast–human chimera analysis identified NBD1 as a major interspecies barrier. Genetic screening yielded hABCE1 revertants that rescue yeast viability but fail to suppress aberrant translation reinitiation in the 3′ UTR.
Eriko Nakata +3 more
wiley +1 more source
Domination Game Critical Graphs
Discussiones Mathematicae Graph Theory, 2015 The domination game is played on a graph G by two players who alternately take turns by choosing a vertex such that in each turn at least one previously undominated vertex is dominated. The game is over when each vertex becomes dominated.
Bujtás Csilla +2 more
doaj +1 more source
IEEE Access, 2019 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
Using fluorescence fluctuation spectroscopy to quantify molecular dynamics within cells
FEBS Open Bio, EarlyView.Microscopy techniques like fluorescence correlation spectroscopy (FCS) and number and brightness analysis (N&B) allow to quantify concentrations, diffusion rates, and oligomerization of fluorescently labeled molecules in the living cell. In this protocol the principles of how to set up these types of experiments are described including calibration ...
Mark A. Hink
wiley +1 more source
On colorings of graph fractional powers
Discrete Mathematics, 2010 \noindent Let $G$ be a simple graph. For any $k\in N$, the $k-$power of $G$ is a simple graph $G^k$ with vertex set $V(G)$ and edge set $\{xy:d_G(x,y)\leq k\}$ and the $k-$subdivision of $G$ is a simple graph $G^{\frac{1}{k}}$, which is constructed by replacing each edge of $G$ with a path of length $k$.
openaire +3 more sources
On The Eigenvalue Distribution Of Adjacency Matrices For Connected Planar Graphs
Quaestiones Geographicae, 2015 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