zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Spectra of graphs. Theory and applications. 3rd rev. a. enl. ed. (English) Zbl 0824.05046
Leipzig: J. A. Barth Verlag. 447 p. DM 168,00; öS 1.310,00; sFr 168,00 (1995).

This is the third, enlarged edition of the book in which the second edition is reproduced and extended by two appendices surveying the recent development in the theory of graph spectra and their applications. The appendices fill up additional 58 pages, while the new references occupy 21 pages. The first edition of the book [Academic Press, New York, 1980, and Deutscher Verlag der Wissenschaften, Berlin (1980; Zbl 0458.05042)] covered almost all results about the spectra of graphs up to 1979. Later discoveries of several important applications of graph eigenvalues in combinatorics and graph theory made the book partially out of date. By surveying these new achievements in the appendices, the authors cover this gap and assure that the book will remain a valuable reference for the researchers in the field.

However, those working in combinatorics, graph theory, or the design of algorithms where graph eigenvalues became a substantial tool, should also consult related recent books and surveys. To mention only some of them, we refer to three excellent books by N. Biggs [Algebraic graph theory, Second edition, Cambridge University Press, Cambridge (1994; Zbl 0797.05032)], A. E. Brouwer, A. M. Cohen and A. Neumaier [Distance-regular graphs, Springer-Verlag, Berlin (1989; Zbl 0747.05073)], C. D. Godsil [Algebraic combinatorics, Chapman & Hall, New York (1993; Zbl 0784.05001)], and to the comprehensive survey by B. Mohar and S. Poljak in [Combinatorial and graph- theoretical problems in linear algebra, Ed. R. A. Brualdi et al., Springer-Verlag, 1993, IMA Vol. Math. Appl. 50, 107-151 (1993; Zbl 0806.90104)].


MSC:
05C50Graphs and linear algebra
05-02Research monographs (combinatorics)
05C85Graph algorithms (graph theory)