On the Laplacian energy of trees with perfect matchings

来源 :第五届全国组合数学与图论大会 | 被引量 : 0次 | 上传用户:cgz1987
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  Let Tn(d) be the set of all trees with n vertices, diameter d and perfect matchings.We will show that the Laplacian energy of any tree in Tn(d), where d =4, 5,is no less than the Laplacian energy of the path Pn.Recently, it has shown that theLaplacian energy of any tree with n vertices is no more than the Laplacian energy of thestar Sn.Thus, it partly shows that the conjecture given by Radenkovi(c) and Gutman is true.
其他文献
会议
会议
会议
会议
会议
会议
会议
  For every undirected graph, Tutte [3] defined a polynomial TG(x;y) in two variables which plays an important role in graph theory.Now this polynomial is cal
会议
  There are two kinds of perfect t-deletion-correcting codes of length k over an alphabet of size v, those where the coordinates may be equal and those where
会议
  In this talk I report some results on the graphs with a unique perfect matching.One of them is a strengthening of Kotzigs theorem, which says that if a conn
会议