Results 51 to 60 of about 1,235,690 (292)

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

Spectral Radius of Nonnegative Centrosymmetric Matrices [PDF]

, 2011
In this paper, we present some results about the spectral radius of a kind of structured matrices, nonnegative centrosymmetric matrices. Furthermore, we constructrue a algorithm to compute the spectral radius of nonnegative centrosymmetric ...
Hongyi, LI
core   +1 more source

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

Identification and characterization of a gene conferring stress resistance in Escherichia coli and cyanobacteria

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, Takaaki Tanaka, Manaka Uehara, Keigo Nakano, Ken Morishima, Rintaro Inoue, Masaaki Sugiyama, Masafumi Yohda   +7 more
wiley   +1 more source

Minimizing Laplacian spectral radius of unicyclic graphs with fixed girth [PDF]

, 2013
summary:In this paper we consider the following problem: Over the class of all simple connected unicyclic graphs on $n$ vertices with girth $g$ ($n$, $g$ being fixed), which graph minimizes the Laplacian spectral radius?
Patra, Kamal Lochan, Sahoo, Binod Kumar
core   +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

Quantitative MRI Uncovers Subtle Cortical Damage in Myelin Oligodendrocyte Glycoprotein Antibody‐Associated Disease

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To determine whether myelin‐sensitive quantitative MRI reveals microstructural abnormalities in normal‐appearing cortex (NACtx) in myelin oligodendrocyte glycoprotein antibody–associated disease (MOGAD), indicating that conventional MRI underestimates remission residual cortical injury.
Valentina Camera, Agnese Tamanti, Silvia Messina, Nicola Dall'Osto, Teresa Maltempo, Stefano Ziccardi, Matteo Foschi, Maria Grazia Piscaglia, Diana Ferraro, Francesco Crescenzo, Francesca Rossi, Albulena Bajrami, Sabrina Marangoni, Damiano Marastoni, Francesca Benedetta Pizzini, Maria Isabel Leite, Roberta Magliozzi, Patrick Waters, Massimiliano Calabrese, Jacqueline Palace, Ruth Geraldes   +20 more
wiley   +1 more source