与指数萨格勒布指数有关的最小树

IF 1 3区数学 Q3 MATHEMATICS, APPLIED Discrete Applied Mathematics Pub Date : 2024-11-15 DOI:10.1016/j.dam.2024.11.007

Nasrin Dehgardi , Mahdieh Azari

{"title":"与指数萨格勒布指数有关的最小树","authors":"Nasrin Dehgardi , Mahdieh Azari","doi":"10.1016/j.dam.2024.11.007","DOIUrl":null,"url":null,"abstract":"<div><div>The concept of the exponential of vertex-degree-based topological indices was raised by Rada (2019) with the aim of studying the discrimination ability of this kind of invariants. In this paper, the minimum values of the exponential of the second Zagreb index and two variants of the first Zagreb index among all <span><math><mi>n</mi></math></span>-vertex trees with maximum degree <span><math><mi>Δ</mi></math></span> are characterized and the corresponding minimal trees are introduced. In addition, results are extended to the class of connected graphs with <span><math><mi>n</mi></math></span> vertices and maximum degree <span><math><mi>Δ</mi></math></span>.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"362 ","pages":"Pages 11-17"},"PeriodicalIF":1.0000,"publicationDate":"2024-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimal trees with respect to exponential Zagreb indices\",\"authors\":\"Nasrin Dehgardi , Mahdieh Azari\",\"doi\":\"10.1016/j.dam.2024.11.007\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The concept of the exponential of vertex-degree-based topological indices was raised by Rada (2019) with the aim of studying the discrimination ability of this kind of invariants. In this paper, the minimum values of the exponential of the second Zagreb index and two variants of the first Zagreb index among all <span><math><mi>n</mi></math></span>-vertex trees with maximum degree <span><math><mi>Δ</mi></math></span> are characterized and the corresponding minimal trees are introduced. In addition, results are extended to the class of connected graphs with <span><math><mi>n</mi></math></span> vertices and maximum degree <span><math><mi>Δ</mi></math></span>.</div></div>\",\"PeriodicalId\":50573,\"journal\":{\"name\":\"Discrete Applied Mathematics\",\"volume\":\"362 \",\"pages\":\"Pages 11-17\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-11-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Applied Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0166218X24004773\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X24004773","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

拉达（2019）提出了基于顶点度的拓扑指数指数的概念，目的是研究这类不变式的判别能力。本文表征了具有最大度 Δ 的所有 n 个顶点树中第二个萨格勒布指数的指数值和第一个萨格勒布指数的两个变体的最小值，并介绍了相应的最小树。此外，还将结果扩展到具有 n 个顶点和最大度数 Δ 的连通图类。

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

查看原文

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

本刊更多论文

Minimal trees with respect to exponential Zagreb indices

The concept of the exponential of vertex-degree-based topological indices was raised by Rada (2019) with the aim of studying the discrimination ability of this kind of invariants. In this paper, the minimum values of the exponential of the second Zagreb index and two variants of the first Zagreb index among all

n

-vertex trees with maximum degree

Δ

are characterized and the corresponding minimal trees are introduced. In addition, results are extended to the class of connected graphs with

n

vertices and maximum degree

Δ

求助全文

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

来源期刊

Discrete Applied Mathematics 数学-应用数学

CiteScore

2.30

自引率

9.10%

发文量

422

审稿时长

4.5 months

期刊介绍： The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal. Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.

期刊最新文献

Multiplicity of signless Laplacian eigenvalue 2 of a connected graph with a perfect matching Rainbow short linear forests in edge-colored complete graph Resistance distances in generalized join graphs Partitions of Zm with identical representation functions Complexity of Maker–Breaker games on edge sets of graphs