New Bounds for Some Topological Indices

Havva Kirgiz, A. D. Maden
{"title":"New Bounds for Some Topological Indices","authors":"Havva Kirgiz, A. D. Maden","doi":"10.1142/s0129054122420230","DOIUrl":null,"url":null,"abstract":"The biological, chemical, and structural properties of molecular graphs can be predicted by using topological indices. The lower and upper bounds of fundamental topological indices are well-studied. In this paper, by using comparison theorem for integrals, we obtain new bounds for some topological indices namely, Randić index, Sombor index, harmonic index and forgotten index.","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"159 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Found. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0129054122420230","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The biological, chemical, and structural properties of molecular graphs can be predicted by using topological indices. The lower and upper bounds of fundamental topological indices are well-studied. In this paper, by using comparison theorem for integrals, we obtain new bounds for some topological indices namely, Randić index, Sombor index, harmonic index and forgotten index.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一些拓扑指标的新界
分子图的生物、化学和结构性质可以用拓扑指数来预测。基本拓扑指标的下界和上界得到了很好的研究。本文利用积分的比较定理,得到了一些拓扑指标即randiovic指标、Sombor指标、调和指标和遗忘指标的新界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
相关文献
A study on the energy performance of a cooling plant system: Air-conditioning in a semiconductor factory
IF 6.7 2区 工程技术Energy and BuildingsPub Date : 2008-01-01 DOI: 10.1016/j.enbuild.2008.02.003
Young-Hak Song , Yasunori Akashi , Jurng-Jae Yee
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The Hardest LL(k) Language Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words Special Issue: 25th International Conference on Developments in Language Theory (DLT 2021) - Preface Transportation Problem Allowing Sending and Bringing Back Online and Approximate Network Construction from Bounded Connectivity Constraints
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1