Results 51 to 60 of about 1,181,505 (283)
Network partition via a bound of the spectral radius [PDF]
, 2016 12 pages, 10 figures© The author 2016. Published by Oxford University Press. Based on the density of connections between the nodes of high degree, we introduce two bounds of the spectral radius.
Mondragön, RJ, Mondragon-Ceballos, RJ
core +1 more source
Optimizing photoexcitation conditions for time‐resolved X‐ray solution scattering experiments
FEBS Open Bio, EarlyView.Time‐resolved X‐ray solution scattering (TR‐XSS) is a powerful technique to visualize how proteins change their structure in real time after light activation. Selecting the right laser photoexcitation conditions—fluence, excitation geometry, and sample refresh rate—is critical to maximize the experimental signal while avoiding unwanted side effects ...
Matteo Levantino
wiley +1 more source
The Minimal Spectral Radius of Graphs with a Given Diameter [PDF]
AMS classsifications: 05C50; 05E99; 94C15;graphs;spectral radius;diameter;networks;virus ...
Kooij, R.E., Dam, E.R. van
core +2 more sources
Spectral radius and extremal graphs for class of unicyclic graph with pendant vertices
Advances in Mechanical Engineering, 2017 In this article, we research on the spectral radius of extremal graphs for the unicyclic graphs with girth g mainly by the graft transformation and matching and obtain the upper bounds of the spectral radius of unicyclic graphs.
Lu Zhi +5 more
doaj +1 more source
FEBS Open Bio, EarlyView.Biophysical characterisation shows that NanX, a membrane transport protein from the major facilitator superfamily (MFS), forms both monomers and dimers after purification. AlphaFold modelling and substrate docking provide information on residues likely involved in substrate recognition for NanX and another MFS member, NanT.
Michael C. Newton‐Vesty +13 more
wiley +1 more source
The Aα-Spectral Radii of Graphs with Given Connectivity
Mathematics, 2019 The A α -matrix is A α ( G ) = α D ( G ) + ( 1 − α ) A ( G ) with α ∈ [ 0 , 1 ] , given by Nikiforov in 2017, where A ( G ) is adjacent matrix, and D ( G ) is its ...
Chunxiang Wang, Shaohui Wang
doaj +1 more source
Albertson (Alb) spectral radii and Albertson (Alb) energies of graph operation
Frontiers in Chemistry, 2023 The sum of the absolute eigenvalues of the adjacency matrix make up graph energy. The greatest absolute eigenvalue of the adjacency matrix is represented by the spectral radius of the graph.
Muhammad Mobeen Munir, Urwah Tul Wusqa
doaj +1 more source
Norm and Numerical Radius Inequalities for a Product of Two Linear Operators in Hilbert Spaces [PDF]
, 2006 The main aim of the present paper is to establish some norm and numerical radius inequalities for the composite operator BA under suitable assumptions for the transform Cα ,β (T) := (T∗ −α I)(β I−T) , where α ,β ∈ C and T ∈ B(H), of the operators ...
S. S. Dragomir +2 more
core +2 more sources
FEBS Open Bio, EarlyView.Functional screening identified PcSyn14890, a cyanobacteria‐specific protein that enhances growth and stress resistance in E. coli and Synechocystis PCC6803. Although we expected it to function as a molecular chaperone, it was unable to protect against thermal aggregation of GAPDH.
Akiyo Yamada +7 more
wiley +1 more source
On the $\alpha$-spectral radius of graphs
Applicable Analysis and Discrete Mathematics, 2018 For $0\le \alpha\le 1$, Nikiforov proposed to study the spectral properties of the family of matrices $A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G)$ of a graph $G$, where $D(G)$ is the degree diagonal matrix and $A(G)$ is the adjacency matrix. The $\alpha$-spectral radius of $G$ is the largest eigenvalue of $A_{\alpha}(G)$. We give upper bounds for $\alpha$
Guo, Haiyan, Zhou, Bo
openaire +4 more sources