Bounds for Degree-Sum adjacency eigenvalues of a graph in terms of Zagreb indices
For a graph $G$ the degree sum adjacency matrix $DS_A(G)$ is defined as a matrix, in which every element is sum of the degrees of the vertices if and only if the corresponding vertices are adjacent, otherwise it is zero. In this paper we obtain the bounds for the spectral radius and partial sum of...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2021-09-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v29-n2/v29-n2-(pp271-283).pdf |
| Summary: | For a graph $G$ the degree sum adjacency matrix $DS_A(G)$ is defined as a matrix, in which every element is sum of the degrees of the vertices if and only if the corresponding vertices are adjacent, otherwise it is zero. In this paper we obtain the bounds for the spectral radius and partial sum of the eigenvalues of the $DS_A$ matrix. We also find the bounds for the $DS_A$ energy of a graph in terms of its Zagreb indices. |
|---|---|
| ISSN: | 1561-4042 |