Mathematics – Combinatorics
Scientific paper
2007-02-24
Mathematics
Combinatorics
Scientific paper
Let G be a graph, H be its chromatic number, L be the largest eigenvalue of
its Laplacian, and M be the largest eigenvalue of its adjacency matrix. Then,
complementing a well-known result of Hoffman, we show that L>=(H/(H-1))M
No associations
LandOfFree
Chromatic number and spectral radius does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Chromatic number and spectral radius, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Chromatic number and spectral radius will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-582307