Some bounds on the distance-sum-connectivity matrix

Creative Commons License


Journal of Inequalities and Applications, vol.2018, 2018 (SCI-Expanded) identifier identifier


The distance-sum-connectivity matrix of a graph G is expressed by δ(i) and δ(j) such that i, j∈ V. δ(i) and δ(j) are represented by a sum of the distance matrices for i< v and j< v, respectively. The purpose of this paper is to give new inequalities involving the eigenvalues, the graph energy, the graph incidence energy, and the matching energy. So, we have some results in terms of the edges, the vertices, and the degrees.