Proof of a problem on Laplacian eigenvalues of trees
详细信息    查看全文
文摘
Denote by μk(L(T)) the k-th Laplacian eigenvalue of a tree T  . Let Tk(2t) be the set of all trees of order 2tk with perfect matchings. In this note, the trees T   in Tk(2t) with View the MathML source are characterized, which solves Problem of J.X. Li, W.C. Shiu and A. Chang in [3] completely.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700