On graphs with the largest Laplacian index

DOI10.1007/S10587-008-0062-3MaRDI QIDQ3624929zbMATH OpenOpenAlexFDO

Authors Zhibo Chen, Muhuo Liu, Bolian Liu

Publication date 6 May 2009

Published in Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/37879, http://hdl.handle.net/10338.dmlcz/140433

zbMATH Keywords

eigenvalueplanar graphalgebraic connectivityregular graphHamiltonian graphLaplacian indexsemi-regular graph

Mathematics Subject Classification ID

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

Recommendations

• A note on the greatest Laplacian eigenvalue of graphs
• A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
• scientific article; zbMATH DE number 4079464
• On graphs with largest Laplacian eigenvalue at most 4
• On graphs whose Laplacian index does not exceed 4.5

Cites work

• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 2010091 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Interlacing eigenvalues and graphs
• Laplacian matrices of graphs: A survey

Cited in

(4)

• The largest Laplacian and adjacency indices of complete caterpillars of fixed diameter
• Some results on the Laplacian spectrum
• On graphs whose Laplacian index does not exceed 4.5
• A note on the greatest Laplacian eigenvalue of graphs

This page was built for publication: On graphs with the largest Laplacian index

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