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: | , , , , |
|---|---|
| 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 |