Abstract
Graphs are naturally associated with matrices, as matrices provide a simple way of representing graphs in computer memory. The basic one of these is the adjacency matrix, which encodes existence of edges joining vertices of a graph. Knowledge of spectral properties of the adjacency matrix is often useful to describe graph properties which are related to the density of the graph’s edges, on either a global or a local level. For example, entries of the principal eigenvector of adjacency matrices have been used in the study of complex networks, introduced under the name eigenvector centrality by the renowned mathematical sociologist Phillip Bonacich back in 1972; see [5, 6].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Stevanović, D. (2018). Spectral Radius of Graphs. In: Encinas, A., Mitjana, M. (eds) Combinatorial Matrix Theory . Advanced Courses in Mathematics - CRM Barcelona. Birkhäuser, Cham. https://doi.org/10.1007/978-3-319-70953-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-70953-6_3
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-319-70952-9
Online ISBN: 978-3-319-70953-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)