On the extremal cacti with minimum Sombor index

Author:

Geng Qiaozhi1,He Shengjie1,Hao Rong-Xia2

Affiliation:

1. School of Science, Tianjin University of Commerce, Tianjin 300134, China

2. Department of Mathematics, Beijing Jiaotong University, Beijing 100044, China

Abstract

<abstract><p>Let $ H $ be a graph with edge set $ E_H $. The Sombor index and the reduced Sombor index of a graph $ H $ are defined as $ SO(H) = \sum\limits_{uv\in E_H}\sqrt{d_{H}(u)^{2}+d_{H}(v)^{2}} $ and $ SO_{red}(H) = \sum\limits_{uv\in E_H}\sqrt{(d_{H}(u)-1)^{2}+(d_{H}(v)-1)^{2}} $, respectively. Where $ d_{H}(u) $ and $ d_{H}(v) $ are the degrees of the vertices $ u $ and $ v $ in $ H $, respectively. A cactus is a connected graph in which any two cycles have at most one common vertex. Let $ \mathcal{C}(n, k) $ be the class of cacti of order $ n $ with $ k $ cycles. In this paper, the lower bound for the Sombor index of the cacti in $ \mathcal{C}(n, k) $ is obtained and the corresponding extremal cacti are characterized when $ n\geq 4k-2 $ and $ k\geq 2 $. Moreover, the lower bound of the reduced Sombor index of cacti is obtained by similar approach.</p></abstract>

Publisher

American Institute of Mathematical Sciences (AIMS)

Subject

General Mathematics

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3