The spectral radius for a class of double-star-like tree systems with maximal degree 4

DOI10.1155/2015/529024zbMath1393.05080OpenAlexW2170735826WikidataQ59118874 ScholiaQ59118874MaRDI QIDQ1665942

Kai Li, Meijin Xu, Yufeng Mao, Yan-Jun Liu, Xiao Dong Chen

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/529024

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• Properties and applications of the eigenvector corresponding to the Laplacian spectral radius of a graph
• Sharp upper bounds for the Laplacian spectral radius of graphs
• The spectral radius of graphs on surfaces
• New upper bounds on the spectral radius of trees with the given number of vertices and maximum degree
• Indices for special classes of trees
• Laplacian spectral characterization of two families of trees
• The largest eigenvalue of a graph: A survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item