![Preface
This book has been written to be of use to mathematicians working in algebraic
(or more precisely, spectral) graph theory. It also contains material that may
be of interest to graduate students dealing with the same subject area. It is
primarily a theoretical book with an indication of possible applications, and so
it can be used by computer scientists, chemists, physicists, biologists, electrical
engineers, and other scientists who are using the theory of graph spectra in their
work.
The rapid development of the theory of graph spectra has caused the ap-
pearance of various inequalities involving spectral invariants of a graph. The
main purpose of this book is to expose those results along with their proofs,
discussions, comparisons, examples, and exercises. We also indicate some con-
jectures and open problems that might provide initiatives for further research.
The book is written to be as self-contained as possible, but we assume famil-
iarity with linear algebra, graph theory, and particularly with the basic concepts
of the theory of graph spectra. For those who need some additional material,
we recommend the books [58, 98, 102, 170].
The graphs considered here are finite, simple (so without loops or multiple
edges), and undirected, and the spectra considered in the largest part of the
book are those of the adjacency matrix, Laplacian matrix, and signless Lapla-
cian matrix of a graph. Although the results may be exposed in different ways,
say from simple to more complicated, or in parts by following their histori-
cal appearance, here we follow the concept of from general to specific, that
is, whenever possible, we give a general result, idea or method, and then its
consequences or particular cases. This concept is applied in many places, see
for example Theorem 2.2 and its consequences, the whole of Subsection 2.1.2
or Theorem 2.19 and its consequences.
ix](https://image.slidesharecdn.com/100481-250415121009-f7540b44/85/Inequalities-for-Graph-Eigenvalues-1st-Edition-Zoran-Stanic-16-320.jpg)
![x Preface
We briefly outline the content of the book. In Chapter 1 we fix the termi-
nology and notation, introduce the matrices associated with a graph, give the
necessary results, select possible applications, and give more details about the
content. In this respect, the last section of this chapter can be considered as
an extension of this Preface. In Chapters 2–4 we consider inequalities that
include the largest, the least, and the second largest eigenvalue of the adja-
cency matrix of a graph, respectively. The last section of Chapter 4 contains
the lists of graphs obtained, together with some additional data. The remain-
ing, less investigated, eigenvalues of the adjacency matrix are considered in
Chapter 5. Chapters 6 and 7 deal with the inequalities for single eigenvalues
of the Laplacian and signless Laplacian matrix. The inequalities that include
multiple eigenvalues of any of three spectra considered before are singled out
in Chapter 8. In Chapter 9 we consider the normalized Laplacian matrix, the
Seidel matrix, and the distance matrix of a graph.
Each of Chapters 2–9 contains theoretical results, comments (including ad-
ditional explanations, similar results or possible applications), comparisons of
inequalities obtained, and numerical or other examples. Each of these chapters
ends with exercises and notes. The exercises contain selected problems or a
small number of the previous results whose proofs were omitted. The notes
contain brief surveys of unmentioned results and directions to the correspond-
ing literature.
Spectral inequalities occupy a central place in this book. Mostly, they are
lower or upper bounds for selected eigenvalues. Apart from these, we con-
sider some results written rather in the form of an inequality that bounds some
structural invariant in terms of graph eigenvalues (and possibly some other
quantities) or, as we have already said, inequalities that include more than one
eigenvalue. All inequalities exposed are listed at the end of the book.
In an informal sense, extremal graph theory deals with the problem of de-
termining extremal graphs for a given graph invariant in a set of graphs with
prescribed properties. In the context of the theory of graph spectra, the invari-
ant in question is a fixed eigenvalue of a matrix associated with a graph or a
spectral invariant based on a number of graph eigenvalues (like the graph en-
ergy). Extremal graphs for a given spectral invariant in various sets of graphs
are widely considered.
The terminology and notation are mainly taken from [98, 102], and they can
also be found in similar literature. However, since there is some overlap in the
wider notation used, we have made some small adjustments for this book only.
The author is grateful to Dragoš Cvetković and Vladimir Nikiforov, who](https://image.slidesharecdn.com/100481-250415121009-f7540b44/85/Inequalities-for-Graph-Eigenvalues-1st-Edition-Zoran-Stanic-17-320.jpg)
![This ebook is for the use of anyone anywhere in the United
States and most other parts of the world at no cost and with
almost no restrictions whatsoever. You may copy it, give it away
or re-use it under the terms of the Project Gutenberg License
included with this ebook or online at www.gutenberg.org. If you
are not located in the United States, you will have to check the
laws of the country where you are located before using this
eBook.
Title: Occoneechee, the Maid of the Mystic Lake
Author: Robert Frank Jarrett
Release date: October 27, 2016 [eBook #53375]
Most recently updated: October 23, 2024
Language: English
Credits: Produced by Jeroen Hellingman and the Online
Distributed
Proofreading Team at http://www.pgdp.net/ for Project
Gutenberg (This file was produced from images
generously
made available by The Internet Archive/American
Libraries.)
*** START OF THE PROJECT GUTENBERG EBOOK OCCONEECHEE,
THE MAID OF THE MYSTIC LAKE ***](https://image.slidesharecdn.com/100481-250415121009-f7540b44/85/Inequalities-for-Graph-Eigenvalues-1st-Edition-Zoran-Stanic-26-320.jpg)
Inequalities for Graph Eigenvalues 1st Edition Zoran Stanić
- 1. Inequalities for Graph Eigenvalues 1st Edition Zoran Stani■ download https://ebookultra.com/download/inequalities-for-graph- eigenvalues-1st-edition-zoran-stanic/ Explore and download more ebooks or textbooks at ebookultra.com
- 2. We believe these products will be a great fit for you. Click the link to download now, or visit ebookultra.com to discover even more! Matrix Inequalities for Iterative Systems 1st Edition Hanjo Taubig https://ebookultra.com/download/matrix-inequalities-for-iterative- systems-1st-edition-hanjo-taubig/ Advances in inequalities for special functions Pietro Cerone https://ebookultra.com/download/advances-in-inequalities-for-special- functions-pietro-cerone/ Advances in Genetics 84 1st Edition Theodore Friedmann https://ebookultra.com/download/advances-in-genetics-84-1st-edition- theodore-friedmann/ Starting Out The c3 Sicilian 1st Edition John Emms https://ebookultra.com/download/starting-out-the-c3-sicilian-1st- edition-john-emms/
- 3. Pareto s 80 20 Rule for Corporate Accountants 1st Edition David Parmenter https://ebookultra.com/download/pareto-s-80-20-rule-for-corporate- accountants-1st-edition-david-parmenter/ Mathematical Inequalities Volume 3 Cyclic and Noncyclic Inequalities 1st Edition Vasile Cîrtoaje https://ebookultra.com/download/mathematical-inequalities- volume-3-cyclic-and-noncyclic-inequalities-1st-edition-vasile- cirtoaje/ Linear Algebra Linear Systems and Eigenvalues P.M. Van Dooren https://ebookultra.com/download/linear-algebra-linear-systems-and- eigenvalues-p-m-van-dooren/ Probabilistic Inequalities 1st Edition George A Anastassiou https://ebookultra.com/download/probabilistic-inequalities-1st- edition-george-a-anastassiou/ Random Graph Dynamics 1st Edition Rick Durrett https://ebookultra.com/download/random-graph-dynamics-1st-edition- rick-durrett/
- 5. Inequalities for Graph Eigenvalues 1st Edition Zoran Stanić Digital Instant Download Author(s): Zoran Stanić ISBN(s): 9781107545977, 1107545978 Edition: 1 File Details: PDF, 1.71 MB Year: 2015 Language: english
- 8. LONDON MATHEMATICAL SOCIETY LECTURE NOTE SERIES Managing Editor: Professor M. Reid, Mathematics Institute, University of Warwick, Coventry CV4 7AL, United Kingdom The titles below are available from booksellers, or from Cambridge University Press at http://www.cambridge.org/mathematics 298 Higher operads, higher categories, T. LEINSTER (ed) 299 Kleinian groups and hyperbolic 3-manifolds, Y. KOMORI, V. MARKOVIC & C. SERIES (eds) 300 Introduction to Möbius differential geometry, U. HERTRICH-JEROMIN 301 Stable modules and the D(2)-problem, F.E.A. JOHNSON 302 Discrete and continuous nonlinear Schrödinger systems, M.J. ABLOWITZ, B. PRINARI & A.D. TRUBATCH 303 Number theory and algebraic geometry, M. REID & A. SKOROBOGATOV (eds) 304 Groups St Andrews 2001 in Oxford I, C.M. CAMPBELL, E.F. ROBERTSON & G.C. SMITH (eds) 305 Groups St Andrews 2001 in Oxford II, C.M. CAMPBELL, E.F. ROBERTSON & G.C. SMITH (eds) 306 Geometric mechanics and symmetry, J. MONTALDI & T. RATIU (eds) 307 Surveys in combinatorics 2003, C.D. WENSLEY (ed.) 308 Topology, geometry and quantum field theory, U.L. TILLMANN (ed) 309 Corings and comodules, T. BRZEZINSKI & R. WISBAUER 310 Topics in dynamics and ergodic theory, S. BEZUGLYI & S. KOLYADA (eds) 311 Groups: topological, combinatorial and arithmetic aspects, T.W. MÜLLER (ed) 312 Foundations of computational mathematics, Minneapolis 2002, F. CUCKER et al (eds) 313 Transcendental aspects of algebraic cycles, S. MÜLLER-STACH & C. PETERS (eds) 314 Spectral generalizations of line graphs, D. CVETKOVIĆ, P. ROWLINSON & S. SIMIĆ 315 Structured ring spectra, A. BAKER & B. RICHTER (eds) 316 Linear logic in computer science, T. EHRHARD, P. RUET, J.-Y. GIRARD & P. SCOTT (eds) 317 Advances in elliptic curve cryptography, I.F. BLAKE, G. SEROUSSI & N.P. SMART (eds) 318 Perturbation of the boundary in boundary-value problems of partial differential equations, D. HENRY 319 Double affine Hecke algebras, I. CHEREDNIK 320 L-functions and Galois representations, D. BURNS, K. BUZZARD & J. NEKOVÁŘ (eds) 321 Surveys in modern mathematics, V. PRASOLOV & Y. ILYASHENKO (eds) 322 Recent perspectives in random matrix theory and number theory, F. MEZZADRI & N.C. SNAITH (eds) 323 Poisson geometry, deformation quantisation and group representations, S. GUTT et al (eds) 324 Singularities and computer algebra, C. LOSSEN & G. PFISTER (eds) 325 Lectures on the Ricci flow, P. TOPPING 326 Modular representations of finite groups of Lie type, J.E. HUMPHREYS 327 Surveys in combinatorics 2005, B.S. WEBB (ed) 328 Fundamentals of hyperbolic manifolds, R. CANARY, D. EPSTEIN & A. MARDEN (eds) 329 Spaces of Kleinian groups, Y. MINSKY, M. SAKUMA & C. SERIES (eds) 330 Noncommutative localization in algebra and topology, A. RANICKI (ed) 331 Foundations of computational mathematics, Santander 2005, L.M PARDO, A. PINKUS, E. SÜLI & M.J. TODD (eds) 332 Handbook of tilting theory, L. ANGELERI HÜGEL, D. HAPPEL & H. KRAUSE (eds) 333 Synthetic differential geometry (2nd Edition), A. KOCK 334 The Navier–Stokes equations, N. RILEY & P. DRAZIN 335 Lectures on the combinatorics of free probability, A. NICA & R. SPEICHER 336 Integral closure of ideals, rings, and modules, I. SWANSON & C. HUNEKE 337 Methods in Banach space theory, J.M.F. CASTILLO & W.B. JOHNSON (eds) 338 Surveys in geometry and number theory, N. YOUNG (ed) 339 Groups St Andrews 2005 I, C.M. CAMPBELL, M.R. QUICK, E.F. ROBERTSON & G.C. SMITH (eds) 340 Groups St Andrews 2005 II, C.M. CAMPBELL, M.R. QUICK, E.F. ROBERTSON & G.C. SMITH (eds) 341 Ranks of elliptic curves and random matrix theory, J.B. CONREY, D.W. FARMER, F. MEZZADRI & N.C. SNAITH (eds) 342 Elliptic cohomology, H.R. MILLER & D.C. RAVENEL (eds) 343 Algebraic cycles and motives I, J. NAGEL & C. PETERS (eds) 344 Algebraic cycles and motives II, J. NAGEL & C. PETERS (eds) 345 Algebraic and analytic geometry, A. NEEMAN 346 Surveys in combinatorics 2007, A. HILTON & J. TALBOT (eds) 347 Surveys in contemporary mathematics, N. YOUNG & Y. CHOI (eds) 348 Transcendental dynamics and complex analysis, P.J. RIPPON & G.M. STALLARD (eds) 349 Model theory with applications to algebra and analysis I, Z. CHATZIDAKIS, D. MACPHERSON, A. PILLAY & A. WILKIE (eds) 350 Model theory with applications to algebra and analysis II, Z. CHATZIDAKIS, D. MACPHERSON, A. PILLAY & A. WILKIE (eds) 351 Finite von Neumann algebras and masas, A.M. SINCLAIR & R.R. SMITH 352 Number theory and polynomials, J. MCKEE & C. SMYTH (eds) 353 Trends in stochastic analysis, J. BLATH, P. MÖRTERS & M. SCHEUTZOW (eds) 354 Groups and analysis, K. TENT (ed) 355 Non-equilibrium statistical mechanics and turbulence, J. CARDY, G. FALKOVICH & K. GAWEDZKI 356 Elliptic curves and big Galois representations, D. DELBOURGO 357 Algebraic theory of differential equations, M.A.H. MACCALLUM & A.V. MIKHAILOV (eds) 358 Geometric and cohomological methods in group theory, M.R. BRIDSON, P.H. KROPHOLLER & I.J. LEARY (eds) 359 Moduli spaces and vector bundles, L. BRAMBILA-PAZ, S.B. BRADLOW, O. GARCÍA-PRADA & S. RAMANAN (eds)
- 9. 360 Zariski geometries, B. ZILBER 361 Words: Notes on verbal width in groups, D. SEGAL 362 Differential tensor algebras and their module categories, R. BAUTISTA, L. SALMERÓN & R. ZUAZUA 363 Foundations of computational mathematics, Hong Kong 2008, F. CUCKER, A. PINKUS & M.J. TODD (eds) 364 Partial differential equations and fluid mechanics, J.C. ROBINSON & J.L. RODRIGO (eds) 365 Surveys in combinatorics 2009, S. HUCZYNSKA, J.D. MITCHELL & C.M. RONEY-DOUGAL (eds) 366 Highly oscillatory problems, B. ENGQUIST, A. FOKAS, E. HAIRER & A. ISERLES (eds) 367 Random matrices: High dimensional phenomena, G. BLOWER 368 Geometry of Riemann surfaces, F.P. GARDINER, G. GONZÁLEZ-DIEZ & C. KOUROUNIOTIS (eds) 369 Epidemics and rumours in complex networks, M. DRAIEF & L. MASSOULIÉ 370 Theory of p-adic distributions, S. ALBEVERIO, A.YU. KHRENNIKOV & V.M. SHELKOVICH 371 Conformal fractals, F. PRZYTYCKI & M. URBAŃSKI 372 Moonshine: The first quarter century and beyond, J. LEPOWSKY, J. MCKAY & M.P. TUITE (eds) 373 Smoothness, regularity and complete intersection, J. MAJADAS & A. G. RODICIO 374 Geometric analysis of hyperbolic differential equations: An introduction, S. ALINHAC 375 Triangulated categories, T. HOLM, P. JØRGENSEN & R. ROUQUIER (eds) 376 Permutation patterns, S. LINTON, N. RUŠKUC & V. VATTER (eds) 377 An introduction to Galois cohomology and its applications, G. BERHUY 378 Probability and mathematical genetics, N. H. BINGHAM & C. M. GOLDIE (eds) 379 Finite and algorithmic model theory, J. ESPARZA, C. MICHAUX & C. STEINHORN (eds) 380 Real and complex singularities, M. MANOEL, M.C. ROMERO FUSTER & C.T.C WALL (eds) 381 Symmetries and integrability of difference equations, D. LEVI, P. OLVER, Z. THOMOVA & P. WINTER- NITZ (eds) 382 Forcing with random variables and proof complexity, J. KRAJÍČEK 383 Motivic integration and its interactions with model theory and non-Archimedean geometry I, R. CLUCKERS, J. NICAISE & J. SEBAG (eds) 384 Motivic integration and its interactions with model theory and non-Archimedean geometry II, R. CLUCKERS, J. NICAISE & J. SEBAG (eds) 385 Entropy of hidden Markov processes and connections to dynamical systems, B. MARCUS, K. PETERSEN & T. WEISSMAN (eds) 386 Independence-friendly logic, A.L. MANN, G. SANDU & M. SEVENSTER 387 Groups St Andrews 2009 in Bath I, C.M. CAMPBELL et al (eds) 388 Groups St Andrews 2009 in Bath II, C.M. CAMPBELL et al (eds) 389 Random fields on the sphere, D. MARINUCCI & G. PECCATI 390 Localization in periodic potentials, D.E. PELINOVSKY 391 Fusion systems in algebra and topology, M. ASCHBACHER, R. KESSAR & B. OLIVER 392 Surveys in combinatorics 2011, R. CHAPMAN (ed) 393 Non-abelian fundamental groups and Iwasawa theory, J. COATES et al (eds) 394 Variational problems in differential geometry, R. BIELAWSKI, K. HOUSTON & M. SPEIGHT (eds) 395 How groups grow, A. MANN 396 Arithmetic differential operators over the p-adic integers, C.C. RALPH & S.R. SIMANCA 397 Hyperbolic geometry and applications in quantum chaos and cosmology, J. BOLTE & F. STEINER (eds) 398 Mathematical models in contact mechanics, M. SOFONEA & A. MATEI 399 Circuit double cover of graphs, C.-Q. ZHANG 400 Dense sphere packings: a blueprint for formal proofs, T. HALES 401 A double Hall algebra approach to affine quantum Schur–Weyl theory, B. DENG, J. DU & Q. FU 402 Mathematical aspects of fluid mechanics, J.C. ROBINSON, J.L. RODRIGO & W. SADOWSKI (eds) 403 Foundations of computational mathematics, Budapest 2011, F. CUCKER, T. KRICK, A. PINKUS & A. SZANTO (eds) 404 Operator methods for boundary value problems, S. HASSI, H.S.V. DE SNOO & F.H. SZAFRANIEC (eds) 405 Torsors, étale homotopy and applications to rational points, A.N. SKOROBOGATOV (ed) 406 Appalachian set theory, J. CUMMINGS & E. SCHIMMERLING (eds) 407 The maximal subgroups of the low-dimensional finite classical groups, J.N. BRAY, D.F. HOLT & C.M. RONEY-DOUGAL 408 Complexity science: the Warwick master’s course, R. BALL, V. KOLOKOLTSOV & R.S. MACKAY (eds) 409 Surveys in combinatorics 2013, S.R. BLACKBURN, S. GERKE & M. WILDON (eds) 410 Representation theory and harmonic analysis of wreath products of finite groups, T. CECCHERINI-SILBERSTEIN, F. SCARABOTTI & F. TOLLI 411 Moduli spaces, L. BRAMBILA-PAZ, O. GARCÍA-PRADA, P. NEWSTEAD & R.P. THOMAS (eds) 412 Automorphisms and equivalence relations in topological dynamics, D.B. ELLIS & R. ELLIS 413 Optimal transportation, Y. OLLIVIER, H. PAJOT & C. VILLANI (eds) 414 Automorphic forms and Galois representations I, F. DIAMOND, P.L. KASSAEI & M. KIM (eds) 415 Automorphic forms and Galois representations II, F. DIAMOND, P.L. KASSAEI & M. KIM (eds) 416 Reversibility in dynamics and group theory, A.G. O’FARRELL & I. SHORT 417 Recent advances in algebraic geometry, C.D. HACON, M. MUSTAŢĂ & M. POPA (eds) 418 The Bloch–Kato conjecture for the Riemann zeta function, J. COATES, A. RAGHURAM, A. SAIKIA & R. SUJATHA (eds) 419 The Cauchy problem for non-Lipschitz semi-linear parabolic partial differential equations, J.C. MEYER & D.J. NEEDHAM 420 Arithmetic and geometry, L. DIEULEFAIT et al (eds) 421 O-minimality and Diophantine geometry, G.O. JONES & A.J. WILKIE (eds) 422 Groups St Andrews 2013, C.M. CAMPBELL et al (eds) 423 Inequalities for Graph Eigenvalues, Z. STANIĆ 424 Surveys in Combinatorics 2015, A. CZUMAJ et al (eds)
- 10. London Mathematical Society Lecture Note Series: 423 Inequalities for Graph Eigenvalues ZORAN STANIĆ University of Belgrade, Serbia
- 11. University Printing House, Cambridge CB2 8BS, United Kingdom Cambridge University Press is part of the University of Cambridge. It furthers the University’s mission by disseminating knowledge in the pursuit of education, learning and research at the highest international levels of excellence. www.cambridge.org Information on this title: www.cambridge.org/9781107545977 © Zoran Stanić 2015 This publication is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University Press. First published 2015 Printed in the United Kingdom by Clays, St Ives plc A catalogue record for this publication is available from the British Library Library of Congress Cataloguing in Publication data Stanić, Zoran, 1975– Inequalities for graph eigenvalues / Zoran Stanic, Univerzitetu Beogradu, Serbia. pages cm. – (London Mathematical Society lecture note series ; 423) Includes bibliographical references and index. ISBN 978-1-107-54597-7 (Paper back : alk. paper) 1. Graph theory. 2. Eigenvalues I. Title. QA166.S73 2015 512.9436–dc23 2015011588 ISBN 978-1-107-54597-7 Paperback Cambridge University Press has no responsibility for the persistence or accuracy of URLs for external or third-party internet websites referred to in this publication, and does not guarantee that any content on such websites is, or will remain, accurate or appropriate.
- 12. Contents Preface page ix 1 Introduction 1 1.1 Graph-theoretic notions 1 1.1.1 Some graphs 5 1.2 Spectra of graphs 8 1.2.1 Spectrum of a graph 10 1.2.2 Laplacian spectrum of a graph 12 1.2.3 Signless Laplacian spectrum of a graph 14 1.2.4 Relations between A, L, and Q 16 1.3 Some more specific elements of the theory of graph spectra 18 1.3.1 Eigenvalue interlacing 18 1.3.2 Small perturbations 19 1.3.3 Hoffman program 20 1.3.4 Star complement technique 21 1.4 A few more words 22 1.4.1 Selected applications 22 1.4.2 Spectral inequalities and extremal graph theory 26 1.4.3 Computer help 27 2 Spectral radius 28 2.1 General inequalities 28 2.1.1 Walks in graphs 29 2.1.2 Graph diameter 38 2.1.3 Other inequalities 43 2.2 Inequalities for spectral radius of particular types of graph 50 2.2.1 Bipartite graphs 51 2.2.2 Forbidden induced subgraphs 55 v
- 13. vi Contents 2.2.3 Nearly regular graphs 56 2.2.4 Nested graphs 58 2.3 Extremal graphs 63 2.3.1 Graphs whose spectral radius does not exceed 3 √ 2 2 63 2.3.2 Order, size, and maximal spectral radius 66 2.3.3 Diameter and extremal spectral radius 68 2.3.4 Trees 71 2.3.5 Various results 74 2.3.6 Ordering graphs 76 Exercises 82 Notes 85 3 Least eigenvalue 87 3.1 Inequalities 87 3.1.1 Bounds in terms of order and size 88 3.1.2 Inequalities in terms of clique number, inde- pendence number or chromatic number 90 3.2 Graphs whose least eigenvalue is at least −2 92 3.3 Graphs with minimal least eigenvalue 95 3.3.1 Least eigenvalue under small graph perturbations 96 3.3.2 Graphs of fixed order and size 98 3.3.3 Graphs with prescribed properties 100 Exercises 102 Notes 103 4 Second largest eigenvalue 105 4.1 Inequalities 105 4.1.1 Regular graphs 106 4.1.2 Trees 113 4.2 Graphs with small second largest eigenvalue 115 4.2.1 Graphs with λ2 ≤ 1 3 or λ2 ≤ √ 2−1 115 4.2.2 The golden section bound 117 4.2.3 Graphs whose second largest eigenvalue does not exceed 1 118 4.2.4 Trees with λ2 ≤ √ 2 123 4.2.5 Notes on reflexive cacti 125 4.2.6 Regular graphs 126 4.3 Appendix 134 Exercises 143 Notes 144
- 14. Contents vii 5 Other eigenvalues of the adjacency matrix 146 5.1 Bounds for λi 146 5.2 Graphs with λ3 0 149 5.3 Graphs G with λn−1(G) and λn−1(G) ≥ −1 150 Exercises 153 Notes 154 6 Laplacian eigenvalues 155 6.1 General inequalities for L-spectral radius 155 6.1.1 Upper bounds 156 6.1.2 Lower bounds 161 6.2 Bounding L-spectral radius of particular types of graph 163 6.2.1 Triangle-free graphs 163 6.2.2 Triangulation graphs 165 6.2.3 Bipartite graphs and trees 167 6.3 Graphs with small L-spectral radius 168 6.4 Graphs with maximal L-spectral radius 169 6.4.1 Graphs with μ1 = n 169 6.4.2 Various graphs 171 6.5 Ordering graphs by L-spectral radius 174 6.6 General inequalities for algebraic connectivity 176 6.6.1 Upper and lower bounds 179 6.6.2 Bounding graph invariants by algebraic con- nectivity 184 6.6.3 Isoperimetric problem and graph expansion 185 6.7 Notes on algebraic connectivity of trees 188 6.8 Graphs with extremal algebraic connectivity 190 6.9 Ordering graphs by algebraic connectivity 193 6.10 Other L-eigenvalues 193 6.10.1 Bounds for μi 194 6.10.2 Graphs with small μ2 or μ3 197 Exercises 198 Notes 202 7 Signless Laplacian eigenvalues 204 7.1 General inequalities for Q-spectral radius 204 7.1.1 Transferring upper bounds for μ1 205 7.2 Bounds for Q-spectral radius of connected nested graphs 210 7.3 Graphs with small Q-spectral radius 213 7.4 Graphs with maximal Q-spectral radius 214 7.4.1 Order, size, and maximal Q-spectral radius 214
- 15. viii Contents 7.4.2 Other results 216 7.5 Ordering graphs by Q-spectral radius 217 7.6 Least Q-eigenvalue 217 7.6.1 Upper and lower bounds 218 7.6.2 Small graph perturbations and graphs with extremal least Q-eigenvalue 221 7.7 Other Q-eigenvalues 222 Exercises 227 Notes 229 8 Inequalities for multiple eigenvalues 231 8.1 Spectral spread 231 8.1.1 Upper and lower bounds 231 8.1.2 Q-Spread and L-spread 234 8.1.3 Extremal graphs 234 8.2 Spectral gap 236 8.3 Inequalities of Nordhaus–Gaddum type 238 8.4 Other inequalities that include two eigenvalues 240 8.5 Graph energy 243 8.6 Estrada index 245 Exercises 247 Notes 250 9 Other spectra of graphs 251 9.1 Normalized L-eigenvalues 251 9.1.1 Upper and lower bounds for μ1 and μn−1 253 9.2 Seidel matrix eigenvalues 255 9.3 Distance matrix eigenvalues 255 9.3.1 Upper and lower bounds for δ1 257 9.3.2 Graphs with small δ2 or large δn 260 Exercises 261 Notes 262 References 265 Inequalities 290 Index 294
- 16. Preface This book has been written to be of use to mathematicians working in algebraic (or more precisely, spectral) graph theory. It also contains material that may be of interest to graduate students dealing with the same subject area. It is primarily a theoretical book with an indication of possible applications, and so it can be used by computer scientists, chemists, physicists, biologists, electrical engineers, and other scientists who are using the theory of graph spectra in their work. The rapid development of the theory of graph spectra has caused the ap- pearance of various inequalities involving spectral invariants of a graph. The main purpose of this book is to expose those results along with their proofs, discussions, comparisons, examples, and exercises. We also indicate some con- jectures and open problems that might provide initiatives for further research. The book is written to be as self-contained as possible, but we assume famil- iarity with linear algebra, graph theory, and particularly with the basic concepts of the theory of graph spectra. For those who need some additional material, we recommend the books [58, 98, 102, 170]. The graphs considered here are finite, simple (so without loops or multiple edges), and undirected, and the spectra considered in the largest part of the book are those of the adjacency matrix, Laplacian matrix, and signless Lapla- cian matrix of a graph. Although the results may be exposed in different ways, say from simple to more complicated, or in parts by following their histori- cal appearance, here we follow the concept of from general to specific, that is, whenever possible, we give a general result, idea or method, and then its consequences or particular cases. This concept is applied in many places, see for example Theorem 2.2 and its consequences, the whole of Subsection 2.1.2 or Theorem 2.19 and its consequences. ix
- 17. x Preface We briefly outline the content of the book. In Chapter 1 we fix the termi- nology and notation, introduce the matrices associated with a graph, give the necessary results, select possible applications, and give more details about the content. In this respect, the last section of this chapter can be considered as an extension of this Preface. In Chapters 2–4 we consider inequalities that include the largest, the least, and the second largest eigenvalue of the adja- cency matrix of a graph, respectively. The last section of Chapter 4 contains the lists of graphs obtained, together with some additional data. The remain- ing, less investigated, eigenvalues of the adjacency matrix are considered in Chapter 5. Chapters 6 and 7 deal with the inequalities for single eigenvalues of the Laplacian and signless Laplacian matrix. The inequalities that include multiple eigenvalues of any of three spectra considered before are singled out in Chapter 8. In Chapter 9 we consider the normalized Laplacian matrix, the Seidel matrix, and the distance matrix of a graph. Each of Chapters 2–9 contains theoretical results, comments (including ad- ditional explanations, similar results or possible applications), comparisons of inequalities obtained, and numerical or other examples. Each of these chapters ends with exercises and notes. The exercises contain selected problems or a small number of the previous results whose proofs were omitted. The notes contain brief surveys of unmentioned results and directions to the correspond- ing literature. Spectral inequalities occupy a central place in this book. Mostly, they are lower or upper bounds for selected eigenvalues. Apart from these, we con- sider some results written rather in the form of an inequality that bounds some structural invariant in terms of graph eigenvalues (and possibly some other quantities) or, as we have already said, inequalities that include more than one eigenvalue. All inequalities exposed are listed at the end of the book. In an informal sense, extremal graph theory deals with the problem of de- termining extremal graphs for a given graph invariant in a set of graphs with prescribed properties. In the context of the theory of graph spectra, the invari- ant in question is a fixed eigenvalue of a matrix associated with a graph or a spectral invariant based on a number of graph eigenvalues (like the graph en- ergy). Extremal graphs for a given spectral invariant in various sets of graphs are widely considered. The terminology and notation are mainly taken from [98, 102], and they can also be found in similar literature. However, since there is some overlap in the wider notation used, we have made some small adjustments for this book only. The author is grateful to Dragoš Cvetković and Vladimir Nikiforov, who
- 18. Preface xi read the manuscript and gave valuable suggestions. In addition, these col- leagues – together with Kinkar Chandra Das, Martin Hasler, and Slobodan K. Simić – gave permission to use some of their proofs with no significant change. Finally, Sarah Lewis helped with correcting language and technical errors, which is much appreciated.
- 20. 1 Introduction In order to make the reading of this book easier, in Section 1.1 we give a survey of the main graph-theoretic terminology and notation. Section 1.2 deals with matrix theory and graph spectra. In Section 1.3 we emphasize some more specific results of the theory of graph spectra that will frequently be used. Once we have fixed the notation and given all the necessary results, in Section 1.4 we say more about the applications of the theory of graph spectra and give some details related to the content of the book. 1.1 Graph-theoretic notions Let G be a finite undirected graph without loops or multiple edges on n vertices labelled 1,2,...,n. We denote the set of vertices of G by V (or V(G)). We say that two vertices i and j are adjacent (or neighbours) if they are joined by an edge and we write i ∼ j. We denote the set of edges of G by E (or E(G)), where an edge ij belongs to E if and only if i ∼ j. In this case we say that the edge ij is incident with vertices i and j. A graph consisting of a single vertex is called the trivial graph. Two edges are said to be adjacent if they are incident with a common vertex. Non-adjacent edges are said to be mutually independent. The number of vertices n and edges m in a graph are called the order and size, respectively. Two graphs G and H are said to be isomorphic if there is a bijection between V(G) and V(H) which preserves the adjacency of their vertices. The fact that G and H are isomorphic we denote by G ∼ = H, but we also use the simple notation G = H. A graph is asymmetric if the only permutation of its vertices which preserves their adjacency is the identity mapping. We say that G is the unique graph satisfying given properties if and only if any other graph with the same properties is isomorphic to G. 1
- 21. Random documents with unrelated content Scribd suggests to you:
- 25. The Project Gutenberg eBook of Occoneechee, the Maid of the Mystic Lake
- 26. This ebook is for the use of anyone anywhere in the United States and most other parts of the world at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re-use it under the terms of the Project Gutenberg License included with this ebook or online at www.gutenberg.org. If you are not located in the United States, you will have to check the laws of the country where you are located before using this eBook. Title: Occoneechee, the Maid of the Mystic Lake Author: Robert Frank Jarrett Release date: October 27, 2016 [eBook #53375] Most recently updated: October 23, 2024 Language: English Credits: Produced by Jeroen Hellingman and the Online Distributed Proofreading Team at http://www.pgdp.net/ for Project Gutenberg (This file was produced from images generously made available by The Internet Archive/American Libraries.) *** START OF THE PROJECT GUTENBERG EBOOK OCCONEECHEE, THE MAID OF THE MYSTIC LAKE ***
- 31. Occoneechee The Maid of the Mystic Lake BY ROBERT FRANK JARRETT Author of “Back Home and Other Poems” THE SHAKESPEARE PRESS 410 E. 32d Street
- 32. New York 1916 Copyrighted, 1916 By R. F. Jarrett
- 33. PREFACE. Realizing that the memory of a nation is best kept aglow by its songs and the writings of its poets, I have been inspired to write OCCONEECHEE, in order that the once powerful nation known as the Cherokee may be preserved in mind, and that their myths, their legends and their traditions may linger and be transmitted to the nations yet to come. Trusting that a generous people may hail with delight the advent of this new work, I now dedicate its pages to all lovers of music, poetry and fine art. When you’ve read its pages give or lend This volume to some good old friend. The Author.
- 34. BRIEF BIOGRAPHY OF THE AUTHOR. Robert Frank Jarrett was born in Asheville, N. C., on July 21st, 1864, and while having resided in other states and cities and visited many of the most important sections of the South, yet has made his principal home within the shadows of the rugged mountain peaks of his native and picturesque home land, the Old North State. He was educated in the field and forest, by rippling stream and rolling rill, studied in the open book of Nature and recited to the Master of Destinies where the shadows of the everlasting hills lock hands with the sunshine of the valley. He is a reader and student of the ancient writers and poets of all ages, singer of the old songs, lover of the new; Servant in official capacity for many years of National, State and Civic governments; humble worker with the busy toilers, and writer of prose and verse from earliest childhood; Author of “Back Home and Other Poems,” published in 1911, and many other manuscripts not yet published. Married to Sallie C. Wild, of Franklin, N. C., on Dec. 25th, 1892. For twenty years a resident of Dillsboro, N. C., where orchard and field and dense deep forests have inspired and impelled him on.
- 35. CONTENTS Page Part I. The Cherokee, 7 Part II. Occoneechee, 21 Part III. Myths of the Cherokee, 127 Part IV. Glossary of Cherokee Words, 197
- 36. ILLUSTRATIONS Portrait of Robert Frank Jarrett, Frontispiece Tuckaseigee Falls, above Dillsboro, 9 Along Scott’s Creek, below Balsam, 21 Sunset from Mt. Junaluska, 26 Lake Junaluska, near Waynesville, 26 A Glimpse of the Craggies, 37 From Top of Chimney Rock, 37 Graybeard Mountain, 37 Chimney Top, 37 Upper Catawba Falls, Esmeralda, 43 Occoneechee Falls, Jackson County, 43 In the Cherokee Country, 43 Whitewater Falls, 43 The Balsam Mountains in Jackson Co., 51 North from Sunset Rock, Tryon Mt., 51 Balsam Mountains, 67 From Bald Rock, 67 Lower Cullasaja Falls, 73 Mount Pisgah, 77 Indian Mound, Franklin, N. C., 77 Tallulah Falls, Ga., 81 Whiteside Mountain, 91 Tennessee River, above Franklin, 99 Lake Toxaway, 99 Tomb of Junaluska, Robbinsville, 107 Where the Serpent Coiled, 107 Harvesting at Cullowhee, N. C., 117 Craggy Mountains from near Asheville, 117 Sequoya, 129 John Ax, the Great Story Teller, 129 Everglades of Florida, 129
- 37. Tuckaseigee River, 139 Kanuga Lake, 153 Lake Fairfield, 153 Pacolet River, Hendersonville, 153 A Cherokee Indian Ball Team, 171 The Pools, Chimney Rock, 171 French Broad River, 185 Broad River, 185 From the Toxaway, 191 Chimney Top Gap, 191 Chimney Rock, 197 Occonestee Falls, 237 Linville Falls, 237 Triple Falls, Buck Forest, 237 High Falls, Buck Forest, 284 Melrose Falls, Tryon, N. C., 284
- 38. PART I
- 39. THE CHEROKEE “I know not how the truth may be, I tell the tale as ’twas told to me.”
- 40. THE CHEROKEE.
- 41. A brief history of the Cherokee Nation or tribe. This history has been gleaned from the works of Ethnology by James Mooney and from word of mouth, as related to the author during the past thirty years. In the beginning of historical events, we hear of man in his paradisaical home, located somewhere within the boundaries known as ancient Egypt or Chaldea. His home was far away and his former history shrouded in the darkness of countless centuries of the past, and when we contemplate the remoteness of his ancestry, we become lost in the midst of our own research. When historical light began to flash from the Orient, we find man emerging with some degree of civilization from a barbaric state into the advanced degrees of civilized and enlightened tribes. When the maritime navigator, full of visions and dreams, dared to sail for those hitherto undiscovered shores, now known as America, there lived within the realm a wandering, happy, yet untutored, race of men whom we afterwards called Indians, who dwelt in great numbers along the whole distance from Penobscot Bay south to the everglades of Florida.
- 42. Welcome to our website – the ideal destination for book lovers and knowledge seekers. With a mission to inspire endlessly, we offer a vast collection of books, ranging from classic literary works to specialized publications, self-development books, and children's literature. Each book is a new journey of discovery, expanding knowledge and enriching the soul of the reade Our website is not just a platform for buying books, but a bridge connecting readers to the timeless values of culture and wisdom. With an elegant, user-friendly interface and an intelligent search system, we are committed to providing a quick and convenient shopping experience. Additionally, our special promotions and home delivery services ensure that you save time and fully enjoy the joy of reading. Let us accompany you on the journey of exploring knowledge and personal growth! ebookultra.com