Some bounds on the distance-sum-connectivity matrix
Journal of Inequalities and Applications, cilt.2018, 2018 (SCI-Expanded, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 2018
- Basım Tarihi: 2018
- Doi Numarası: 10.1186/s13660-018-1766-z
- Dergi Adı: Journal of Inequalities and Applications
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
- Anahtar Kelimeler: Bounds, Distance-sum-connectivity matrix
- Açık Arşiv Koleksiyonu: AVESİS Açık Erişim Koleksiyonu
- Hakkari Üniversitesi Adresli: Evet
Özet
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.