000			01895nam a22001937a 4500
003			OSt
005			20240923170914.0
008			180910b ||||| |||| 00| 0 eng d
020			_a9781107411470
040			_cEducational Supplies _aICTS-TIFR
050			_aQA166
100			_aPiet van Mieghem
245			_aGraph spectra for complex networks
260			_aNew York: _bCambridge University Press, _c[c2011]
300			_a346 p
505			_a1 - Introduction Part I - Spectra of graphs 2 - Algebraic graph theory 3 - Eigenvalues of the adjacency matrix 4 - Eigenvalues of the Laplacian Q 5 - Spectra of special types of graphs 6 - Density function of the eigenvalues 7 - Spectra of complex networks Part II - Eigensystem and polynomials 8 - Eigensystem of a matrix 9 - Polynomials with real coefficients 10 - Orthogonal polynomials
520			_aAnalyzing the behavior of complex networks is an important element in the design of new man-made structures such as communication systems and biologically engineered molecules. Because any complex network can be represented by a graph, and therefore in turn by a matrix, graph theory has become a powerful tool in the investigation of network performance. This self-contained 2010 book provides a concise introduction to the theory of graph spectra and its applications to the study of complex networks. Covering a range of types of graphs and topics important to the analysis of complex systems, this guide provides the mathematical foundation needed to understand and apply spectral insight to real-world systems. In particular, the general properties of both the adjacency and Laplacian spectrum of graphs are derived and applied to complex networks. An ideal resource for researchers and students in communications networking as well as in physics and mathematics.--- summary provided by publisher
942			_2lcc _cBK
999			_c2052 _d2052