On the spectral radius of weighted trees with given number of pendant vertices and a positive weight set

DOI10.1080/03081087.2011.639371zbMath1253.05095OpenAlexW2024447489MaRDI QIDQ5200331

Yi Tian, Shuchao Li

Publication date: 5 November 2012

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2011.639371

zbMATH Keywords

spectral radiusweighted graphPerron vectorstarlike tree

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Signed and weighted graphs (05C22)

Related Items (2)

Relations between the inertia indices of a mixed graph and those of its underlying graph ⋮ Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph

Cites Work

• Unnamed Item
• On the (Laplacian) spectral radius of weighted trees with fixed matching number q and a positive weight set
• On the spectra of some weighted rooted trees and applications
• A nontrivial upper bound on the largest Laplacian eigenvalue of weighted graphs
• On the spectra of some graphs like weighted rooted trees
• A sharp upper bound on the spectral radius of weighted graphs
• On the spectral radius of weighted trees with fixed diameter and weight set
• Minimum spectral radius of a weighted graph
• An extremal problem for the spectral radius of a graph
• A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs
• On the spectral radius of weighted unicyclic graphs with a positive weight set
• Matrix Analysis

This page was built for publication: On the spectral radius of weighted trees with given number of pendant vertices and a positive weight set