Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/11552
Title: On spectral radius and energy of extended adjacency matrix of graphs
Authors: das, kinkar
Gutman I.
Furtula, Boris
Issue Date: 2017
Abstract: © 2016 Elsevier Inc. Let G be a graph of order n. For i=1,2,…,n, let di be the degree of the vertex vi of G. The extended adjacency matrix Aex of G is defined so that its (i, j)-entry is equal to 12(didj+djdi) if the vertices vi and vj are adjacent, and 0 otherwise,Yang et al. (1994). The spectral radius η1 and the energy Eex of the Aex-matrix are examined. Lower and upper bounds on η1 and Eex are obtained, and the respective extremal graphs characterized.
URI: https://scidar.kg.ac.rs/handle/123456789/11552
Type: article
DOI: 10.1016/j.amc.2016.10.029
ISSN: 0096-3003
SCOPUS: 2-s2.0-84993944715
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

404

Downloads(s)

9

Files in This Item:
File Description SizeFormat 
PaperMissing.pdf
  Restricted Access
29.86 kBAdobe PDFThumbnail
View/Open


Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.