Spectral radius and average 2-degree sequence of a graph

DOI10.1142/S1793830914500293MaRDI QIDQ2875695zbMATH OpenFDO

Authors Yu-Pei Huang, Chih-Wen Weng

Publication date 11 August 2014

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830914500293

zbMATH Keywords

adjacency matrixaverage 2-degreespectral radius

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• On the spectral radius of graphs
• Sharp upper bounds on the spectral radius of graphs
• Spectral radius and degree sequence of a graph
• Some sharp upper bounds on the spectral radius of graphs
• A sharp lower bound of the spactral radius of simple graphs

Cited in

(7)

• An extending result on spectral radius of bipartite graphs
• Spectral radius of bipartite graphs
• Sharp bounds for the spectral radius of nonnegative matrices
• On the graph of nilpotent matrix group of length one
• Spectral Radius and Degree Sequence
• scientific article; zbMATH DE number 1156665 (Why is no real title available?)
• A matrix realization of spectral bounds

This page was built for publication: Spectral radius and average 2-degree sequence of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875695)