Some new bounds on the general sum–connectivity index
Let $G=(V,E)$ be a simple connected graph with $n$ vertices, $m$ edges and sequence of vertex degrees $d_1 \ge d_2 \ge \cdots \ge d_n>0$, $d_i=d(v_i)$, where $v_i\in V$. With $i\sim j$ we denote adjacency of vertices $v_i$ and $v_j$. The general sum--connectivity index of graph is defined as...
Main Authors: | Akbar Ali, Mubeen Javaid, Marjan Matejic, Igor Milovanovic, Emina Milovanovic |
---|---|
Format: | Article |
Language: | English |
Published: |
Azarbaijan Shahide Madani University
2020-12-01
|
Series: | Communications in Combinatorics and Optimization |
Subjects: | |
Online Access: | http://comb-opt.azaruniv.ac.ir/article_13987_683b3467bb550bc427ec378858c86a80.pdf |
Similar Items
-
Some new upper bounds for the inverse sum indeg index of graphs
by: Akbar Ali, et al.
Published: (2020-04-01) -
A note on the variable sum exdeg index/coindex of trees
by: Marjan Matejic, et al.
Published: (2020-12-01) -
On the extremal cactus graphs for variable sum exdeg index with a fixed number of cycles
by: Mubeen Javaid, et al.
Published: (2020-09-01) -
On the graph connectivity and the variable sum exdeg index
by: Jianwei Du, et al.
Published: (2021-11-01) -
Beyond the Zagreb indices
by: Ivan Gutman, et al.
Published: (2020-01-01)