Spectral Radius of Graphs

Nonfiction, Science & Nature, Mathematics, Combinatorics, Algebra
Cover of the book Spectral Radius of Graphs by Dragan Stevanovic, Elsevier Science
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Dragan Stevanovic ISBN: 9780128020975
Publisher: Elsevier Science Publication: October 13, 2014
Imprint: Academic Press Language: English
Author: Dragan Stevanovic
ISBN: 9780128020975
Publisher: Elsevier Science
Publication: October 13, 2014
Imprint: Academic Press
Language: English

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
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Elsevier Science

Cover of the book Long-Term Performance of Permeable Reactive Barriers by Dragan Stevanovic
Cover of the book Orthogonal Waveforms and Filter Banks for Future Communication Systems by Dragan Stevanovic
Cover of the book Computer Modeling in Inorganic Crystallography by Dragan Stevanovic
Cover of the book Field Guide to Freshwater Invertebrates of North America by Dragan Stevanovic
Cover of the book Flow and Contaminant Transport in Fractured Rock by Dragan Stevanovic
Cover of the book Advances in Virus Research by Dragan Stevanovic
Cover of the book The War Within Us by Dragan Stevanovic
Cover of the book Materials for Fuel Cells by Dragan Stevanovic
Cover of the book Commercial Data Mining by Dragan Stevanovic
Cover of the book Gold Ore Processing by Dragan Stevanovic
Cover of the book Hacking Web Intelligence by Dragan Stevanovic
Cover of the book Statistical Inference in Financial and Insurance Mathematics with R by Dragan Stevanovic
Cover of the book Neurobiology of Addiction by Dragan Stevanovic
Cover of the book Centrosome and Centriole by Dragan Stevanovic
Cover of the book Optically Amplified WDM Networks by Dragan Stevanovic
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy