Pakistan Science Abstracts
Choose Theme
1
2
3
4
Theme 1
— Green & Gold
Print
Save as PDF
Export BibTeX
Close
No Detail Found!
Home
›
Discrete Mathematics Letters
On a conjecture regarding the exponential reduced Sombor index of chemical trees
Author(s)
Amjad E. Hamza
Department of Mathematics, Faculty of Science, University of Ha'il,Ha'il,Saudi Arabia
Akbar Aliy
Department of Mathematics, Faculty of Science, University of Ha'il,Ha'il,Saudi Arabia
Abstract
Let G be a graph and denote by du the degree of a vertex u of G. The sum of the numbers ep(du 1)2+(dv 1)2 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.
Publication Details
Page(s)
107-110
DOI
10.47443/dml.2021.s217
Published
Journal: Discrete Mathematics Letters, Volume: 9, Issue: 0, Year: 2022
Request the full text from PASTIC
Keywords
reduced Sombor index, Sombor index, Topological index, exponential reduced Sombor index, chemical graph theory
More from
Discrete Mathematics Letters
Trinajstic index
A curious family of convex benzenoids and their altans
Padmakar-Ivan index of some types of perfect graphs
Steiner Wiener index and line graphs of trees
Multiplicative Sombor index of graphs
0
Citations
0
Downloads
60
Views