Journal
LINEAR ALGEBRA AND ITS APPLICATIONS
Volume 414, Issue 2-3, Pages 407-424Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.laa.2005.10.017
Keywords
conjecture; automatic generation of conjectures; Laplacian matrix; Laplacian eigenvalues; graph
Categories
Ask authors/readers for more resources
Several upper bounds on the largest Laplacian eigenvalue of a graph G, in terms of degree and average degree of neighbors of its vertices, have been proposed in the literature. We show that all these bounds, as well as many conjectured new ones, can be generated systematically using some simple algebraic manipulations. Bounds depending on the edges of G are also generated. Moreover, the interestingness of bounds is discussed, in terms of dominance and tightness. Finally, we give a unified way of proving a sample of these bounds. (c) 2005 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available