Minimum spectral radius of a weighted graph
نویسندگان
چکیده
منابع مشابه
The Spectral Radius of A Planar Graph
A decomposition result for planar graphs is used to prove that the spectral radius of a planar graph on n vertices is less than 4 + 3(n 3) Moreover, the spectral radius of an outerplanar graph on n vertices is less than 1 + JZ+&-X
متن کاملExtremal graph characterization from the bounds of the spectral radius of weighted graphs
We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues of a graph are the eigenvalues of its adjacency matrix. We obtain a lower bound and an upper bound on the spectral radius of the adjacency matrix of weighted graphs and characterize graphs for which the bounds are attained. 2011 Elsevier Inc. All rights reserved.
متن کاملThe Laplacian spectral radius of a graph under perturbation
In this paper, we investigate how the Laplacian spectral radius changes when one graph is transferred to another graph obtained from the original graph by adding some edges, or subdivision, or removing some edges from one vertex to another. c © 2007 Elsevier Ltd. All rights reserved.
متن کاملSpectral Radius and Degree Sequence of a Graph
Let G be a simple connected graph of order n with degree sequence d1, d2, · · · , dn in non-increasing order. The spectral radius ρ(G) of G is the largest eigenvalue of its adjacency matrix. For each positive integer ` at most n, we give a sharp upper bound for ρ(G) by a function of d1, d2, · · · , d`, which generalizes a series of previous results.
متن کاملOn the spectral radius of a directed graph
We provide upper estimates on the spectral radius of a directed graph. In particular we prove that the spectral radius is bounded by the maximum of the geometric mean of in-degree and out-degree taken over all vertices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1992
ISSN: 0024-3795
DOI: 10.1016/0024-3795(92)90249-a