The minimum Sombor index of trees with given number of pendant vertices

被引:4
|
作者
Maitreyi, Venkatesan [1 ]
Elumalai, Suresh [1 ]
Balachandran, Selvaraj [2 ]
Liu, Hechao [3 ]
机构
[1] SRM Inst Sci & Technol, Fac Engn & Technol, Coll Engn & Technol, Dept Math, Kattankulathur 603203, Tamil Nadu, India
[2] SASTRA Deemed Univ, Sch Arts Sci Humanities & Educ, Dept Math, Thanjavur, India
[3] Hubei Normal Univ, Sch Math & Stat, Huangshi 435002, Peoples R China
来源
COMPUTATIONAL & APPLIED MATHEMATICS | 2023年 / 42卷 / 08期
关键词
Sombor index; Tree; Pendant vertex; ABC INDEX;
D O I
10.1007/s40314-023-02479-4
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
For any graph G, the Sombor index is defined as SO(G) = Sigma(uv is an element of E(G)) root d(G)(2)(u) + d(G)(2) (v), where d(G)(u) is the degree of the vertex u in G. In this paper, we determine the minimum Sombor index of trees of order n >= 7 with p = >= 3 pendant vertices, which gives the partial solution for the open problem Das et al. (Mathematics 9:#1202, 2021). Our results also extend the results Liu et al. (Int J Quantum Chem 121: #e26689, 2021), about the minimum value of the Sombor index of chemical trees of order n with p pendant vertices.
引用
收藏
页数:9
相关论文
共 50 条
  • [1] The minimum Sombor index of trees with given number of pendant vertices
    Venkatesan Maitreyi
    Suresh Elumalai
    Selvaraj Balachandran
    Hechao Liu
    Computational and Applied Mathematics, 2023, 42
  • [2] On the Extremal General Sombor Index of Trees with Given Pendent Vertices
    Maitreyi, Venkatesan
    Elumalai, Suresh
    Balachandran, Selvaraj
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2024, 92 (01) : 225 - 248
  • [3] On Sombor Index of Graphs with a Given Number of Cut-Vertices
    Hayat, Sakander
    Rehman, Ansar
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2023, 89 (02) : 437 - 450
  • [4] Minimum harmonic indices of trees and unicyclic graphs with given number of pendant vertices and diameter
    Zhu, Yan
    Chang, Renying
    UTILITAS MATHEMATICA, 2014, 93 : 365 - 374
  • [5] A Note on the Minimum Wiener Polarity Index of Trees with a Given Number of Vertices and Segments or Branching Vertices
    Noureen, Sadia
    Bhatti, Akhlaq Ahmad
    Ali, Akbar
    DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2021, 2021
  • [6] Laplacian coefficients of trees with given diameter and number of pendant vertices
    Tan, Shang-Wang
    Wang, Qi-Long
    Zhongguo Shiyou Daxue Xuebao (Ziran Kexue Ban)/Journal of China University of Petroleum (Edition of Natural Science), 2013, 37 (02): : 186 - 190
  • [7] The Wiener index of unicyclic graphs given number of pendant vertices or cut vertices
    Shang-wang Tan
    Qi-long Wang
    Yan Lin
    Journal of Applied Mathematics and Computing, 2017, 55 : 1 - 24
  • [8] Minimum general Randic index on chemical trees with given order and number of pendent vertices
    Li, Xueliang
    Shi, Yongtang
    Zhong, Lingping
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2008, 60 (02) : 539 - 554
  • [9] The Wiener index of unicyclic graphs given number of pendant vertices or cut vertices
    Tan, Shang-wang
    Wang, Qi-long
    Lin, Yan
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2017, 55 (1-2) : 1 - 24
  • [10] On the signless Laplacian index of cacti with a given number of pendant vertices
    Li, Shuchao
    Zhang, Minjie
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2012, 436 (12) : 4400 - 4411