给定最大树度的树的一般总连接指数和一般兰迪克指数

IF 1 Q1 MATHEMATICS Discrete Mathematics Letters Pub Date : 2023-12-11 DOI:10.47443/dml.2023.140

Elize Swartz, Tom´aˇs Vetr´ık

{"title":"给定最大树度的树的一般总连接指数和一般兰迪克指数","authors":"Elize Swartz, Tom´aˇs Vetr´ık","doi":"10.47443/dml.2023.140","DOIUrl":null,"url":null,"abstract":"For trees with given number of vertices n and maximum degree ∆ , we present lower bounds on the general sum-connectivity index χ a if a > 0 and 3 ≤ ∆ ≤ n − 1 , and an upper bound on the general Randi´c index R a if − 0 . 283 ≤ a < 0 and 3 ≤ ∆ ≤ (cid:98) n − 1 2 (cid:99) . All the extremal trees for our bounds are given.","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2023-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"General sum-connectivity index and general Randic index of trees with given maximum degree\",\"authors\":\"Elize Swartz, Tom´aˇs Vetr´ık\",\"doi\":\"10.47443/dml.2023.140\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For trees with given number of vertices n and maximum degree ∆ , we present lower bounds on the general sum-connectivity index χ a if a > 0 and 3 ≤ ∆ ≤ n − 1 , and an upper bound on the general Randi´c index R a if − 0 . 283 ≤ a < 0 and 3 ≤ ∆ ≤ (cid:98) n − 1 2 (cid:99) . All the extremal trees for our bounds are given.\",\"PeriodicalId\":36023,\"journal\":{\"name\":\"Discrete Mathematics Letters\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47443/dml.2023.140\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics Letters","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47443/dml.2023.140","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

对于具有给定顶点数 n 和最大度数 ∆ 的树，如果 a > 0 且 3 ≤ ∆ ≤ n - 1，我们给出了一般和连接性指数 χ a 的下限；如果 - 0 . 283 ≤ a < 0 且 3 ≤ ∆ ≤ (cid:98) n - 1 2 (cid:99) ，我们给出了一般 Randi´c 指数 R a 的上限。我们给出了边界的所有极值树。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

General sum-connectivity index and general Randic index of trees with given maximum degree

For trees with given number of vertices n and maximum degree ∆ , we present lower bounds on the general sum-connectivity index χ a if a > 0 and 3 ≤ ∆ ≤ n − 1 , and an upper bound on the general Randi´c index R a if − 0 . 283 ≤ a < 0 and 3 ≤ ∆ ≤ (cid:98) n − 1 2 (cid:99) . All the extremal trees for our bounds are given.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊