Ordering Trees by Their Largest Laplacian Eigenvalues
2009
It is shown that some transformations change the largest Laplacian eigenvalue of a tree T.By applying these results,we get the order of trees by their largest Laplacian eigenvalues.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI