On estimating a lower bound for the Laplacian spectral radius of triangle-free graphs

zbMATH Open1273.05131MaRDI QIDQ2853445FDOQ2853445

Authors: Amal Al-Saket 

Publication date: 22 October 2013

Published in: International Journal of Contemporary Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: http://www.m-hikari.com/ijcms/ijcms-2012/45-48-2012/index.html

Recommendations

• scientific article; zbMATH DE number 1833074
• Estimating the algebraic connectivity of triangle-free graphs
• Lower bounds for the Laplacian spectral radius of graphs
• An improved upper bound for the Laplacian spectral radius of graphs
• A note on the upper bounds for the Laplacian spectral radius of graphs

zbMATH Keywords

graphseigenvaluesgenerating functionspectral radiuscharacteristic polynomialprincipal submatrixinterlacingLaplacian matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Matrices of integers (15B36)

Cited In (3)

• Title not available (Why is that?)
• Some spectral inequalities for triangle-free regular graphs
• Estimating the algebraic connectivity of triangle-free graphs

This page was built for publication: On estimating a lower bound for the Laplacian spectral radius of triangle-free graphs

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