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 |
| _version_ | 1818989041099472896 |
|---|---|
| author | Gülistan Kaya Gök |
| author_facet | Gülistan Kaya Gök |
| author_sort | Gülistan Kaya Gök |
| collection | DOAJ |
| description | 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 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. |
| first_indexed | 2024-12-20T19:32:10Z |
| format | Article |
| id | doaj.art-a387b8d7a85e434faed3759e4e6a5167 |
| institution | Directory Open Access Journal |
| issn | 1029-242X |
| language | English |
| last_indexed | 2024-12-20T19:32:10Z |
| publishDate | 2018-07-01 |
| publisher | SpringerOpen |
| record_format | Article |
| series | Journal of Inequalities and Applications |
| spelling | doaj.art-a387b8d7a85e434faed3759e4e6a51672022-12-21T19:28:46ZengSpringerOpenJournal of Inequalities and Applications1029-242X2018-07-012018111110.1186/s13660-018-1766-zSome bounds on the distance-sum-connectivity matrixGülistan Kaya Gök0Department of Mathematics Education, Hakkari UniversityAbstract 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 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.http://link.springer.com/article/10.1186/s13660-018-1766-zDistance-sum-connectivity matrixBounds |
| spellingShingle | Gülistan Kaya Gök Some bounds on the distance-sum-connectivity matrix Journal of Inequalities and Applications Distance-sum-connectivity matrix Bounds |
| title | Some bounds on the distance-sum-connectivity matrix |
| title_full | Some bounds on the distance-sum-connectivity matrix |
| title_fullStr | Some bounds on the distance-sum-connectivity matrix |
| title_full_unstemmed | Some bounds on the distance-sum-connectivity matrix |
| title_short | Some bounds on the distance-sum-connectivity matrix |
| title_sort | some bounds on the distance sum connectivity matrix |
| topic | Distance-sum-connectivity matrix Bounds |
| url | http://link.springer.com/article/10.1186/s13660-018-1766-z |
| work_keys_str_mv | AT gulistankayagok someboundsonthedistancesumconnectivitymatrix |