Dragan Stevanovic – författare

Spectral Radius of Graphs provides a thorough overview of important results on the spectral radius of adjacency matrix of graphs that have appeared in the literature in the preceding ten years, most of them with proofs, and including some previously unpublished results of the author. The primer begins with a brief classical review, in order to provide the reader with a foundation for the subsequent chapters. Topics covered include spectral decomposition, the Perron-Frobenius theorem, the Rayleigh quotient, the Weyl inequalities, and the Interlacing theorem. From this introduction, the book delves deeper into the properties of the principal eigenvector; a critical subject as many of the results on the spectral radius of graphs rely on the properties of the principal eigenvector for their proofs. A following chapter surveys spectral radius of special graphs, covering multipartite graphs, non-regular graphs, planar graphs, threshold graphs, and others. Finally, the work explores results on the structure of graphs having extreme spectral radius in classes of graphs defined by fixing the value of a particular, integer-valued graph invariant, such as: the diameter, the radius, the domination number, the matching number, the clique number, the independence number, the chromatic number or the sequence of vertex degrees.

Throughout, the text includes the valuable addition of proofs to accompany the majority of presented results. This enables the reader to learn tricks of the trade and easily see if some of the techniques apply to a current research problem, without having to spend time on searching for the original articles. The book also contains a handful of open problems on the topic that might provide initiative for the reader's research.

Dedicated coverage to one of the most prominent graph eigenvalues Proofs and open problems included for further study Overview of classical topics such as spectral decomposition, the Perron-Frobenius theorem, the Rayleigh quotient, the Weyl inequalities, and the Interlacing theorem

Spectral Radius of Graphs provides a thorough overview of important results on the spectral radius of adjacency matrix of graphs that have appeared in the literature in the preceding ten years, most of them with proofs, and including some previously unpublished results of the author. The primer begins with a brief classical review, in order to provide the reader with a foundation for the subsequent chapters. Topics covered include spectral decomposition, the Perron-Frobenius theorem, the Rayleigh quotient, the Weyl inequalities, and the Interlacing theorem. From this introduction, the book delves deeper into the properties of the principal eigenvector; a critical subject as many of the results on the spectral radius of graphs rely on the properties of the principal eigenvector for their proofs. A following chapter surveys spectral radius of special graphs, covering multipartite graphs, non-regular graphs, planar graphs, threshold graphs, and others. Finally, the work explores results on the structure of graphs having extreme spectral radius in classes of graphs defined by fixing the value of a particular, integer-valued graph invariant, such as: the diameter, the radius, the domination number, the matching number, the clique number, the independence number, the chromatic number or the sequence of vertex degrees.Throughout, the text includes the valuable addition of proofs to accompany the majority of presented results. This enables the reader to learn tricks of the trade and easily see if some of the techniques apply to a current research problem, without having to spend time on searching for the original articles. The book also contains a handful of open problems on the topic that might provide initiative for the reader''s research.- Dedicated coverage to one of the most prominent graph eigenvalues- Proofs and open problems included for further study- Overview of classical topics such as spectral decomposition, the Perron-Frobenius theorem, the Rayleigh quotient, the Weyl inequalities, and the Interlacing theorem

This book contains the notes of the lectures delivered at an Advanced Course on Combinatorial Matrix Theory held at Centre de Recerca Matemàtica (CRM) in Barcelona. These notes correspond to five series of lectures. The first series is dedicated to the study of several matrix classes defined combinatorially, and was delivered by Richard A. Brualdi. The second one, given by Pauline van den Driessche, is concerned with the study of spectral properties of matrices with a given sign pattern. Dragan Stevanović delivered the third one, devoted to describing the spectral radius of a graph as a tool to provide bounds of parameters related with properties of a graph. The fourth lecture was delivered by Stephen Kirkland and is dedicated to the applications of the Group Inverse of the Laplacian matrix. The last one, given by Ángeles Carmona, focuses on boundary value problems on finite networks with special in-depth on the M-matrix inverse problem.