关于化学树指数化简Sombor指数的一个猜想

IF 1 Q1 MATHEMATICS

Discrete Mathematics Letters Pub Date : 2022-05-19 DOI:10.47443/dml.2021.s217

A. Hamza, Akbar Ali

{"title":"关于化学树指数化简Sombor指数的一个猜想","authors":"A. Hamza, Akbar Ali","doi":"10.47443/dml.2021.s217","DOIUrl":null,"url":null,"abstract":"Let G be a graph and denote by du the degree of a vertex u of G. The sum of the numbers e √ (du−1)+(dv−1) over all edges uv of G is known as the exponential reduced Sombor index. A chemical tree is a tree with the maximum degree at most 4. In this paper, a conjecture posed by Liu et al. [MATCH Commun. Math. Comput. Chem. 86 (2021) 729–753] is disproved and its corrected version is proved.","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2022-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On a Conjecture Regarding the Exponential Reduced Sombor Index of Chemical Trees\",\"authors\":\"A. Hamza, Akbar Ali\",\"doi\":\"10.47443/dml.2021.s217\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G be a graph and denote by du the degree of a vertex u of G. The sum of the numbers e √ (du−1)+(dv−1) over all edges uv of G is known as the exponential reduced Sombor index. A chemical tree is a tree with the maximum degree at most 4. In this paper, a conjecture posed by Liu et al. [MATCH Commun. Math. Comput. Chem. 86 (2021) 729–753] is disproved and its corrected version is proved.\",\"PeriodicalId\":36023,\"journal\":{\"name\":\"Discrete Mathematics Letters\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2022-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47443/dml.2021.s217\",\"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.2021.s217","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 2

摘要

设G是一个图，用du表示G的顶点u的度数。所有边uv (G)上e√(du−1)+(dv−1)的和称为指数化简Sombor指数。化学树是最大度不超过4的树。本文采用Liu et al. [MATCH common .]提出的一个猜想。数学。第一版。化学。86(2021)729-753]被反驳，其更正版本被证明。

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

查看原文本刊更多论文

On a Conjecture Regarding the Exponential Reduced Sombor Index of Chemical Trees

Let G be a graph and denote by du the degree of a vertex u of G. The sum of the numbers e √ (du−1)+(dv−1) over all edges uv of G is known as the exponential reduced Sombor index. A chemical tree is a tree with the maximum degree at most 4. In this paper, a conjecture posed by Liu et al. [MATCH Commun. Math. Comput. Chem. 86 (2021) 729–753] is disproved and its corrected version is proved.

求助全文

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

来源期刊

Discrete Mathematics Letters Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.50

自引率

12.50%

发文量

审稿时长

12 weeks