Kragujevac树终端距离矩阵的特征多项式和谱

IF 1 Q4 CHEMISTRY, MULTIDISCIPLINARY
A. Heydari
{"title":"Kragujevac树终端距离矩阵的特征多项式和谱","authors":"A. Heydari","doi":"10.22052/IJMC.2021.242219.1559","DOIUrl":null,"url":null,"abstract":"In this paper‎, ‎the characteristic polynomial and the spectrum of the terminal distance matrix for some Kragujevac trees is computed. ‎As Application‎, ‎we obtain an upper bound and a lower bound for the spectral radius of the terminal distance matrix of the Kragujevac trees‎.","PeriodicalId":14545,"journal":{"name":"Iranian journal of mathematical chemistry","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Characteristic Polynomial and Spectrum of the Terminal Distance Matrix of Kragujevac Trees\",\"authors\":\"A. Heydari\",\"doi\":\"10.22052/IJMC.2021.242219.1559\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper‎, ‎the characteristic polynomial and the spectrum of the terminal distance matrix for some Kragujevac trees is computed. ‎As Application‎, ‎we obtain an upper bound and a lower bound for the spectral radius of the terminal distance matrix of the Kragujevac trees‎.\",\"PeriodicalId\":14545,\"journal\":{\"name\":\"Iranian journal of mathematical chemistry\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2021-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Iranian journal of mathematical chemistry\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22052/IJMC.2021.242219.1559\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Iranian journal of mathematical chemistry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22052/IJMC.2021.242219.1559","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

本文计算了一些Kragujevac树的特征多项式和终端距离矩阵的谱。作为应用,我们得到了Kragujevac树终端距离矩阵谱半径的上界和下界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On the Characteristic Polynomial and Spectrum of the Terminal Distance Matrix of Kragujevac Trees
In this paper‎, ‎the characteristic polynomial and the spectrum of the terminal distance matrix for some Kragujevac trees is computed. ‎As Application‎, ‎we obtain an upper bound and a lower bound for the spectral radius of the terminal distance matrix of the Kragujevac trees‎.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Iranian journal of mathematical chemistry
Iranian journal of mathematical chemistry CHEMISTRY, MULTIDISCIPLINARY-
CiteScore
2.10
自引率
7.70%
发文量
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学术官方微信