On the Laplacian spectral radii of bipartite graphs

DOI10.1016/j.laa.2011.04.008zbMath1222.05164OpenAlexW2079829873MaRDI QIDQ551348

Wai Hong Chan, Wai Chee Shiu, Jian Xi Li

Publication date: 15 July 2011

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2011.04.008

zbMATH Keywords

bipartite graphLaplacian spectral radius

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

The smallest Laplacian spectral radius of graphs with a given clique number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The effect on the Laplacian spectral radius of a graph by adding or grafting edges
• On the Laplacian spectral radius of trees with fixed diameter
• The Laplacian spectral radii of trees with degree sequences
• Laplacian spectral radius of trees with given maximum degree
• Graphs for which the least eigenvalue is minimal. II.
• The Laplacian spectral radius of some graphs
• On the Laplacian spectral radius of a tree.
• On the largest eigenvalue of a tree with perfect matchings
• The Laplacian spectral radius of some bipartite graphs
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• The Laplacian Spectrum of a Graph
• The Laplacian Spectrum of a Graph II

This page was built for publication: On the Laplacian spectral radii of bipartite graphs