Characterization of graphs having extremal Randic indices
SCIE
SCOPUS
- Title
- Characterization of graphs having extremal Randic indices
- Authors
- Das, KC; Kwak, JH
- Date Issued
- 2007-01-01
- Publisher
- ELSEVIER SCIENCE INC
- Abstract
- The higher Randic index R-t(G) of a simple graph G is defined as [GRAPHICS] where delta(i) denotes the degree of the vertex i and i(1)i(2) ... i(t+1) runs, over all paths of length t in G. In [J.A. Rodriguez, A spectral approach to the Randic index, Linear Algebra Appl. 400 (2005) 339-344], the lower and upper bound on R-1(G) was determined in terms of a kind of Laplacian spectra, and the lower and upper bound on R-2(G) were done in terms of kinds of adjacency and Laplacian spectra. In this paper we characterize the graphs which achieve the upper or lower bounds of R-1(G) and R-2(G), respectively. (c) 2006 Elsevier Inc. All rights reserved.
- Keywords
- Randic index; connectivity index; adjacency matrix; Laplacian matrix; CONNECTIVITY INDEX; BOUNDS; TREES
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/23657
- DOI
- 10.1016/j.laa.2006.06.020
- ISSN
- 0024-3795
- Article Type
- Article
- Citation
- LINEAR ALGEBRA AND ITS APPLICATIONS, vol. 420, no. 1, page. 124 - 134, 2007-01-01
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.