Laplacian energy of trees with at most 10 vertices

M. U. Rehman, M. Ajmal, T. Kamran
{"title":"Laplacian energy of trees with at most 10 vertices","authors":"M. U. Rehman, M. Ajmal, T. Kamran","doi":"10.19184/IJC.2018.2.1.3","DOIUrl":null,"url":null,"abstract":"Let T<sub>n</sub> be the set of all trees with n ≤ 10 vertices. We show that the Laplacian energy of any tree T<sub>n</sub> is strictly between the Laplacian energy of the path Pn and the star S<sub>n</sub>, partially proving the conjecture that this hold for any tree.","PeriodicalId":13506,"journal":{"name":"Indonesian Journal of Combinatorics","volume":"52 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Indonesian Journal of Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.19184/IJC.2018.2.1.3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Let Tn be the set of all trees with n ≤ 10 vertices. We show that the Laplacian energy of any tree Tn is strictly between the Laplacian energy of the path Pn and the star Sn, partially proving the conjecture that this hold for any tree.
最多有10个顶点的树的拉普拉斯能量
设Tn为n≤10个顶点的所有树的集合。我们证明了任何树Tn的拉普拉斯能量严格地介于路径Pn和恒星Sn的拉普拉斯能量之间,部分地证明了这一假设对任何树都成立。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信