04712cam a2200445Mi 4500001001300000003000600013005001700019006001900036007001500055008004100070040008500111019002500196020002800221020002500249020001500274020001800289020001800307035005700325050002300382082001500405100003600420245007900456264003000535264001200565300005100577336002600628337002600654338003600680347001900716504005100735588008200786520205200868505058102920505058703501650001804088650004404106655002204150856007504172999001904247ocn896835905OCoLC20190328114809.0m     o  d        cr cn|||||||||141021t20152015enka    ob    001 0 eng d  aE7BbengerdaepncE7BdUIUdOCLCFdOPELSdCOOdOCLCQdFEMdOCLCQdU3WdD6HdAU@  a968008290a969073233  a9780128020975q(e-book)  a0128020970q(e-book)  a0128020687  a9780128020685  z9780128020685  a(OCoLC)896835905z(OCoLC)968008290z(OCoLC)969073233 4aQA166b.S74 2015eb04a511/.52231 aStevanovi�c, Dragan,eauthor.10aSpectral radius of graphs / h[electronic resource]cDragan Stevanovi�c. 1aLondon :bElsevier,c2015 4c�2015  a1 online resource (167 pages) :billustrations  atextbtxt2rdacontent  acomputerbc2rdamedia  aonline resourcebcr2rdacarrier  atext file2rda  aIncludes bibliographical references and index.0 aOnline resource; title from PDF title page (ebrary, viewed October 21, 2014).  aSpectral 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.0 aFront Cover; Spectral Radius of Graphs; Copyright; Dedication; Contents; Preface; Chapter 1: Introduction; 1.1 Graphs and Their Invariants; 1.2 Adjacency Matrix, Its Eigenvalues, and Its Characteristic Polynomial; 1.3 Some Useful Tools from Matrix Theory; Chapter 2: Properties of the Principal Eigenvector; 2.1 Proportionality Lemma and the Rooted Product; 2.2 Principal Eigenvector Components Along a Path; 2.3 Extremal Components of the Principal Eigenvector; 2.4 Optimally Decreasing Spectral Radius by Deleting Vertices or Edges; 2.4.1 Vertex Removal; 2.4.2 Edge Removal.8 a2.5 Regular, Harmonic, and Semiharmonic GraphsChapter 3: Spectral Radius of Particular Types of Graphs; 3.1 Nonregular Graphs; 3.2 Graphs with a Given Degree Sequence; 3.3 Graphs with a Few Edges; 3.3.1 Trees; 3.3.2 Planar Graphs; 3.4 Complete Multipartite Graphs; Chapter 4: Spectral Radius and Other Graph Invariants; 4.1 Selected AutoGraphiX Conjectures; 4.2 Clique Number; 4.3 Chromatic Number; 4.4 Independence Number; 4.5 Matching Number; 4.6 The Diameter; 4.7 The Radius; 4.8 The Domination Number; 4.9 Nordhaus-Gaddum Inequality for the Spectral Radius; Bibliography; Index. 0aGraph theory. 7aGraph theory.2fast0(OCoLC)fst00946584 4aElectronic books.403ScienceDirectuhttp://www.sciencedirect.com/science/book/9780128020685  c247004d247004