Results 51 to 60 of about 67,270 (298)

Spectral Sufficient Conditions on Pancyclic Graphs

Complexity, 2021
A pancyclic graph of order n is a graph with cycles of all possible lengths from 3 to n. In fact, it is NP-complete that deciding whether a graph is pancyclic.
Guidong Yu, Tao Yu, Xiangwei Xia, Huan Xu   +3 more
doaj   +1 more source

Degree Deviation and Spectral Radius

The Electronic Journal of Combinatorics
For a finite, simple, and undirected graph $G$ with $n$ vertices, $m$ edges, and largest eigenvalue $\lambda$, Nikiforov introduced the degree deviation of $G$ as$$s=\sum_{u\in V(G)}\left|d_G(u)-\frac{2m}{n}\right|.$$Contributing to a conjecture of Nikiforov, we show $\lambda-\frac{2m}{n}\leq \sqrt{\frac{2s}{3}}$.
Dieter Rautenbach, Florian Werner 0003
openaire   +3 more sources

Structural studies and functional engineering of NanX: an anhydro‐sialic acid transporter from Escherichia coli

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, Kelsi R. Hall, Zachary D. Tillett, Liam S. Turk, James S. Davies, Michael J. Currie, Hamish G. Brown, Sepideh Valimehr, Peter D. Mace, Andrew E. Whitten, Santosh Panjikar, Eric Hanssen, Rachel A. North, Renwick C.J. Dobson   +13 more
wiley   +1 more source

The generalized spectral radius and extremal norms [PDF]

, 2002
The generalized spectral radius, also known under the name of joint spectral radius, or (after taking logarithms) maximal Lyapunov exponent of a discrete inclusion is examined.
Wirth, Fabian
core   +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   +4 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, Meijin Xu, Xiujuan Liu, Xiaodong Chen, Chen Chen, Yan-Jun Liu   +5 more
doaj   +1 more source

Extending stability through hierarchical clusters in Echo State Networks

Frontiers in Neuroinformatics, 2010
Echo State Networks (ESN) are reservoir networks that satisfy well-established criteria for stability when constructed as feedforward networks. Recent evidence suggests that stability criteria are altered in the presence of reservoir substructures, such ...
Sarah Jarvis, Sarah Jarvis, Stefan Rotter, Stefan Rotter, Ulrich Egert, Ulrich Egert   +5 more
doaj   +1 more source

Paramagnetic Rim Lesions Are Associated With Trans‐Synaptic Degeneration of the Visual Pathway in Multiple Sclerosis

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objectives Retrograde trans‐synaptic degeneration (rTSD) from posterior visual pathway lesions in multiple sclerosis (MS) is characterized by hemi‐macular ganglion cell‐inner plexiform layer (GCIPL) thinning and contralateral visual field loss.
Abdul Jaber Tayem, Angel Liu, Sargis Manukyan, Mustafa Subhi, Elaina Luskin, Bryan Quah, Sreekanth Madhusoodhanan Nair, Arzu C. Has Silemek, Gabriela Zabala, Yujie Cui, Laura Locke, Paula Barreras, Marwa Kaisey, Vinicius Calsavara, Daniel S. Reich, Nancy L. Sicotte, Pascal Sati, Omar Al‐Louzi   +17 more
wiley   +1 more source

Perron-Frobenius Theorem for Spectral Radius Analysis [PDF]

, 2016
The spectral radius of a matrixAis the maximum norm of alleigenvalues ofA. In previous work we already formalized that for acomplex matrixA, the values inAngrow polynomially innif andonly if the spectral radius is at most one.
José Divasón [0000-0002-5173-128X], Akihisa Yamada, René Thiemann, Ondřej Kunčar   +3 more
core  

Spectral characterizations of graphs with small spectral radius [PDF]

, 2012
A graph is said to have a small spectral radius if it does not exceed the corresponding Hoffmann limit value. In the case of (signless) Laplacian matrix, the Hoffmann limit value is equal to ε+2=4.38+, with ε being the real root of x3-4x-4.
BELARDO, Francesco, Belardo, F., Wang, Jianfeng   +2 more
core   +1 more source