Some bounds on the distance-sum-connectivity matrix
Abstract The distance-sum-connectivity matrix of a graph G is expressed by δ(i) $\delta(i)$ and δ(j) $\delta(j)$ such that i,j∈V $i,j\in V$. δ(i) $\delta(i)$ and δ(j) $\delta(j)$ are represented by a sum of the distance matrices for i<v $i< v$ and j<v $j< v$, respectively. The purpose of...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2018-07-01
|
| Series: | Journal of Inequalities and Applications |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1186/s13660-018-1766-z |