具有固定叶数的n阶树的最大原子键和连接性指数

IF 1 Q1 MATHEMATICS

Discrete Mathematics Letters Pub Date : 2023-03-28 DOI:10.47443/dml.2023.016

Sadia Noureen, Akbar Ali

{"title":"具有固定叶数的n阶树的最大原子键和连接性指数","authors":"Sadia Noureen, Akbar Ali","doi":"10.47443/dml.2023.016","DOIUrl":null,"url":null,"abstract":"Let G be a graph. For an edge e of G , denote by d e the number of edges adjacent to e . The atom-bond sum-connectivity (ABS) index of G is deﬁned as ABS ( G ) = (cid:80) e ∈ E ( G ) (cid:112) 1 − 2( d e + 2) − 1 . A graph of order n is known as an n -order graph. The problem of determining trees possessing the minimum ABS index among all n -order trees with ﬁxed number of leaves has recently been attacked in two preprints independently. This article provides a complete solution to the maximal version of the aforementioned problem","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2023-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Maximum Atom-Bond Sum-Connectivity Index of n-Order Trees With Fixed Number of Leaves\",\"authors\":\"Sadia Noureen, Akbar Ali\",\"doi\":\"10.47443/dml.2023.016\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G be a graph. For an edge e of G , denote by d e the number of edges adjacent to e . The atom-bond sum-connectivity (ABS) index of G is deﬁned as ABS ( G ) = (cid:80) e ∈ E ( G ) (cid:112) 1 − 2( d e + 2) − 1 . A graph of order n is known as an n -order graph. The problem of determining trees possessing the minimum ABS index among all n -order trees with ﬁxed number of leaves has recently been attacked in two preprints independently. This article provides a complete solution to the maximal version of the aforementioned problem\",\"PeriodicalId\":36023,\"journal\":{\"name\":\"Discrete Mathematics Letters\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47443/dml.2023.016\",\"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.016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 6

摘要

设G是一个图。对于G的边e，用d e表示与e相邻的边的数量。G的原子键和连接性（ABS）指数定义为ABS（G）=（cid:80）e∈e（G）（cid:112）1−2（d e+2）−1。n阶图被称为n阶图。在所有具有固定叶数的n阶树中，确定具有最小ABS指数的树的问题最近在两份预印本中受到了独立的攻击。本文为上述问题的最大版本提供了一个完整的解决方案

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

查看原文本刊更多论文

Maximum Atom-Bond Sum-Connectivity Index of n-Order Trees With Fixed Number of Leaves

Let G be a graph. For an edge e of G , denote by d e the number of edges adjacent to e . The atom-bond sum-connectivity (ABS) index of G is deﬁned as ABS ( G ) = (cid:80) e ∈ E ( G ) (cid:112) 1 − 2( d e + 2) − 1 . A graph of order n is known as an n -order graph. The problem of determining trees possessing the minimum ABS index among all n -order trees with ﬁxed number of leaves has recently been attacked in two preprints independently. This article provides a complete solution to the maximal version of the aforementioned problem

求助全文

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

来源期刊

Discrete Mathematics Letters Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.50

自引率

12.50%

发文量

审稿时长

12 weeks