On spectral radius and energy of extended adjacency matrix of graphs

Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/11552

Full metadata record

DC Field	Value	Language
dc.contributor.author	das, kinkar	-
dc.contributor.author	Gutman I.	-
dc.contributor.author	Furtula, Boris	-
dc.date.accessioned	2021-04-20T18:38:19Z	-
dc.date.available	2021-04-20T18:38:19Z	-
dc.date.issued	2017	-
dc.identifier.issn	0096-3003	-
dc.identifier.uri	https://scidar.kg.ac.rs/handle/123456789/11552	-
dc.description.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.	-
dc.rights	restrictedAccess	-
dc.source	Applied Mathematics and Computation	-
dc.title	On spectral radius and energy of extended adjacency matrix of graphs	-
dc.type	article	-
dc.identifier.doi	10.1016/j.amc.2016.10.029	-
dc.identifier.scopus	2-s2.0-84993944715	-
Appears in Collections:	Faculty of Science, Kragujevac

113

6

Files in This Item:

File	Description	Size	Format
PaperMissing.pdf Restricted Access		29.86 kB	Adobe PDF	View/Open

SCIDAR - A Digital Archive of the University of Kragujevac