2018 info:eu-repo/semantics/article https://phaidrabg.bg.ac.rs/o:28915 doi:10.5937/SPSUNP1801033Z ISSN: 2217-5539 Abstract: Let G = (V, E), V = {1, 2, . . . , n}, be a simple graph of order n and size m, without isolated vertices. Denote by d1 ≥ d2 ≥ • • • ≥ dn = d > 0, di = d(i), a sequence of its vertex degrees. If vertices i and j are adjacent, we write i ∼ j. With TI we denote a topological index that can be represented as T I = T I(G) = ∑▒〖F(di,d j),〗 where F is an appropriately chosen function with the property F(x, y) = F(y, x). Randić degree–based adjacency matrix RA = (ri j) is defined as rij = F(di,d j )/didj if i ∼ j, and 0 otherwise. Denote by f1 ≥ f2 ≥ • • • ≥ fn the eigenvalues of RA. Upper and lower bounds for fi, i = 1, 2, . . . , n are obtained. Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics 10(1) Zogić, Emir Borovićanin, Bojana Milovanović, Igor Milovanović, Emina On bounds of eigenvalues of Randić vertex-degree-based adjacency matrix All rights reserved eng application/pdf 52679 bytes Keywords: Topological indices, adjacency matrices, bounds of eigenvalues.