Results 11 to 20 of about 1,644,718 (204)
Relating Estrada index with spectral radius [PDF]
The Estrada index EE is a recently proposed molecular structure-descriptor, used in the modeling of certain features of the 3D structure of organic molecules, in particular of the degree of folding of proteins and other long-chain biopolymers.
Gutman Ivan +4 more
doaj +5 more sources
Optimal network modification for spectral radius dependent phase transitions
The dynamics of contact processes on networks is often determined by the spectral radius of the networks adjacency matrices. A decrease of the spectral radius can prevent the outbreak of an epidemic, or impact the synchronization among systems of coupled
Yonatan Rosen +2 more
doaj +2 more sources
A note on distance spectral radius of trees
The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. We determine the unique non-starlike non-caterpillar tree with maximal distance spectral radius.
Wang Yanna +3 more
doaj +2 more sources
The spectral radius of graphs with no odd wheels [PDF]
S. Cioabă +2 more
semanticscholar +3 more sources
Joint and Generalized Spectral Radius of Upper Triangular Matrices with Entries in a Unital Banach Algebra [PDF]
In this paper, we discuss some properties of joint spectral {radius(jsr)} and generalized spectral radius(gsr) for a finite set of upper triangular matrices with entries in a Banach algebra and represent relation between geometric and joint/generalized
Hamideh Mohammadzadehkan +2 more
doaj +1 more source
The spanning k-trees, perfect matchings and spectral radius of graphs [PDF]
A k-tree is a spanning tree in which every vertex has degree at most k. In this paper, we provide a sufficient condition for the existence of a k-tree in a connected graph with fixed order in terms of the adjacency spectral radius and the signless ...
Dandan Fan +3 more
semanticscholar +1 more source
On the Aα-spectral radius of connected graphs
For a simple graph G , the generalized adjacency matrix A α ( G ) is defined as A α ( G ) = αD ( G ) + (1 − α ) A ( G ) , α ∈ [0 , 1] , where A ( G ) is the adjacency matrix and D ( G ) is the diagonal matrix of the vertex degrees. It is clear that A 0 (
A. Alhevaz +3 more
semanticscholar +1 more source
Proof of a conjecture on the ϵ-spectral radius of trees
The ϵ-spectral radius of a connected graph is the largest eigenvalue of its eccentricity matrix. In this paper, we identify the unique n-vertex tree with diameter 4 and matching number 5 that minimizes the ϵ-spectral radius, and thus resolve a conjecture
Jianping Li , Leshi Qiu , Jianbin Zhang
doaj +1 more source
Unbalanced signed graphs with extremal spectral radius or index
Let G˙=(G,σ)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\dot{G}=(G ...
M. Brunetti, Z. Stanić
semanticscholar +1 more source
A spectral method for retrieving cloud optical thickness and effective radius from surface-based transmittance measurements [PDF]
We introduce a new spectral method for the retrieval of optical thickness and effective radius from cloud transmittance that relies on the spectral slope of the normalized transmittance between 1565 nm and 1634 nm, and on cloud transmittance at a visible
P. J. McBride +4 more
doaj +1 more source

