Results 71 to 80 of about 323,816 (328)
Gap sets for the spectra of cubic graphs [PDF]
Alicia J. Kollár, Peter Sarnak
openalex +1 more source
An \(n\)-fold periodic locally finite graph in the Euclidean \(n\)-space may be considered the parent of an infinite class of \(n\)-dimensional toroidal finite graphs. An elementary method is developed that allows the characteristic polynomials of these graphs to be factored in a uniform manner, into smaller polynomials, all of the same size.
John, Peter E., Sachs, Horst
openaire +2 more sources
Dormant cancer cells can hide in distant organs for years, evading treatment and the immune system. This review highlights how signals from the surrounding tissue and immune environment keep these cells inactive or trigger their reawakening. Understanding these mechanisms may help develop therapies to eliminate or control dormant cells and prevent ...
Kanishka Tiwary +1 more
wiley +1 more source
Bounds of the Spectral Radius and the Nordhaus-Gaddum Type of the Graphs
The Laplacian spectra are the eigenvalues of Laplacian matrix L(G)=D(G)-A(G), where D(G) and A(G) are the diagonal matrix of vertex degrees and the adjacency matrix of a graph G, respectively, and the spectral radius of a graph G is the largest ...
Tianfei Wang, Liping Jia, Feng Sun
doaj +1 more source
Endomorphism Spectra of Double Fan Graphs
There are six different classes of endomorphisms for a graph. The sets of these endomorphisms always form a chain under the inclusion of sets. For a more systematic treatment of different endomorphisms, Böttcher and Knauer proposed the concepts of the ...
Mengdi Tong, Hailong Hou
doaj +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
In this paper, three sorts of network indices for the weighted three-layered graph are studied through the methods of graph spectra theory combined with analysis methods.
Jicheng Bian +3 more
doaj +1 more source
Revisiting two classical results on graph spectra
Let mu(G) and mu_min(G) be the largest and smallest eigenvalues of the adjacency matricx of a graph G. We refine quantitatively the following two results on graph spectra. (i) if H is a proper subgraph of a connected graph G, then mu(G)>mu(H).
Nikiforov, Vladimir
core +1 more source
MiR‐513a promotes human erythroid differentiation by modulating c‐Jun
During early human erythropoiesis, miR‐513a promoted erythroid differentiation in primary human CD34+ hematopoietic stem‐progenitor cells and human TF‐1 erythroleukemic cells by indirectly decreasing c‐Jun and phospho‐c‐Jun expression, which are associated with increased GATA1 expression.
MinJung Kim +11 more
wiley +1 more source
New skew equienergetic oriented graphs [PDF]
Let $S(G^{\sigma})$ be the skew-adjacency matrix of the oriented graph $G^{\sigma}$, which is obtained from a simple undirected graph $G$ by assigning an orientation $\sigma$ to each of its edges.
X. Liu, L. Wang, C. Duan
doaj +1 more source

