ͼµÄÆװ뾶

Ŀ¼ 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 ofthe 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.5 Regular£¬ Harmonic£¬ and Semiharmonic Graphs
Chapter 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.4 Complete Multipartite Graphs
Chapter 4 SDectral Radius and Other Graph Invariants
4.1 Selected AutoGraphiX Conjectures
4.2 Clique Numbei
4.3 Chromatic Number
4.4 IndependenceNumber
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