On spectral radius and energy of extended adjacency matrix of graphs

Kinkar Ch. Das, Ivan Gutman and Boris Furtula

Applied Mathematics and Computation, 2017, vol. 296, issue C, 116-123

Abstract: 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.

Keywords: Spectrum (of graph); Extended adjacency matrix; Extended spectral radius (of graph); Extended energy (of graph) (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316306361
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:296:y:2017:i:c:p:116-123

DOI: 10.1016/j.amc.2016.10.029

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().