Two shorter proofs in spectral graph theory

DOI10.2298/PETF0314094SzbMATH Open1104.05048MaRDI QIDQ3409924FDOQ3409924

Authors: Dragan Stevanović, Slobodan K. Simić 

Publication date: 20 November 2006

Published in: Publikacije Elektrotehnickog fakulteta - serija: matematika (Search for Journal in Brave)

Recommendations

• New proofs for two upper bounds on the Laplacian spectral radius of graphs
• Some sharp upper bounds on the spectral radius of graphs
• Sharp bounds on the spectral radius and the energy of graphs
• scientific article; zbMATH DE number 1877024
• Some new bounds on the spectral radius of graphs

zbMATH Keywords

spectral radiusvertex degreesvertex eccentricitiesgraph angles

Mathematics Subject Classification ID

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

Cited In (6)

• A note on a theorem of Horst Sachs
• Spectral distances in some sets of graphs
• On the irregularity of uniform hypergraphs
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• A new proof for some theorems in graph theory
• Lower bounds for the spectral norm of digraphs

This page was built for publication: Two shorter proofs in spectral graph theory

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