Bounds for Degree-Sum adjacency eigenvalues of a graph in terms of Zagreb indices
Închide
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
331 20
Ultima descărcare din IBN:
2023-09-13 06:43
Căutarea după subiecte
similare conform CZU
519.17 (68)
Analiză combinatorică. Teoria grafurilor (115)
SM ISO690:2012
SHINDE, Sumedha S., SWAMY, Narayan, GUDIMANI, Shaila, RAMANE, H. S.. Bounds for Degree-Sum adjacency eigenvalues of a graph in terms of Zagreb indices. In: Computer Science Journal of Moldova, 2021, nr. 2(86), pp. 271-283. ISSN 1561-4042.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Computer Science Journal of Moldova
Numărul 2(86) / 2021 / ISSN 1561-4042 /ISSNe 2587-4330

Bounds for Degree-Sum adjacency eigenvalues of a graph in terms of Zagreb indices

CZU: 519.17
MSC 2010: 05C05.

Pag. 271-283

Shinde Sumedha S.1, Swamy Narayan1, Gudimani Shaila1, Ramane H. S.2
 
1 KLE Technological University,
2 Department of Mathematics, Karnatak University
 
 
Disponibil în IBN: 21 septembrie 2021


Rezumat

For a graph G the degree sum adjacency matrix DSA(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 DSA matrix. We also find the bounds for the DSA energy of a graph in terms of its Zagreb indices.

Cuvinte-cheie
Adjacency eigenvalues, degree sum adjacency matrix, Zagreb index, eigenvalues, energy