We first establish the relationship between the largest eigenvalue of the Laplacian matrix of a graph and its bipartite density. Then, we present lower and upper bounds for the largest Laplacian eigenvalue of a graph in terms of its largest degree and diameter.