Recent results in the theory of graph spectra [electronic resource] / Dragoš M. Cvetković [and others]

The purpose of this volume is to review the results in spectral graph theory which have appeared since 1978. The problem of characterizing graphs with least eigenvalue -2 was one of the original problems of spectral graph theory. The techniques used in the investigation of this problem have continue...

Full description

Saved in:
Bibliographic Details
Online Access: Full Text (via ScienceDirect)
Other Authors: Cvetković, Dragoš M.
Other title:Graph spectra.
Format: Electronic eBook
Language:English
Published: Amsterdam ; New York : New York, N.Y., U.S.A. : North-Holland ; Sole distributors for the U.S.A. and Canada, Elsevier Science, 1988.
Series:Annals of discrete mathematics ; 36.
Subjects:

MARC

LEADER 00000cam a2200000xa 4500
001 b10319718
003 CoU
005 20190126013004.6
006 m o d
007 cr |||||||||||
008 090320s1988 ne a ob 001 0 eng d
019 |a 312463608  |a 646774138  |a 742293128  |a 815691495  |a 823118409  |a 823839038  |a 823907417  |a 824096708  |a 824149535 
020 |a 9780444703613 
020 |a 0444703616 
020 |a 9780080867762  |q (electronic bk.) 
020 |a 0080867766  |q (electronic bk.) 
020 |a 1281793159 
020 |a 9781281793157 
035 |a (OCoLC)scd316549646 
035 |a (OCoLC)316549646  |z (OCoLC)312463608  |z (OCoLC)646774138  |z (OCoLC)742293128  |z (OCoLC)815691495  |z (OCoLC)823118409  |z (OCoLC)823839038  |z (OCoLC)823907417  |z (OCoLC)824096708  |z (OCoLC)824149535 
040 |a OPELS  |b eng  |e pn  |c OPELS  |d OPELS  |d OCLCQ  |d OCLCF  |d OCLCO  |d DEBBG  |d N$T  |d IDEBK  |d E7B  |d MERUC  |d YDXCP  |d OCLCQ  |d DEBSZ  |d OCLCQ 
049 |a GWRE 
050 4 |a QA166  |b .R43 1988eb 
245 0 0 |a Recent results in the theory of graph spectra  |h [electronic resource] /  |c Dragoš M. Cvetković [and others] 
246 3 |a Graph spectra. 
260 |a Amsterdam ;  |a New York :  |b North-Holland ;  |a New York, N.Y., U.S.A. :  |b Sole distributors for the U.S.A. and Canada, Elsevier Science,  |c 1988. 
300 |a 1 online resource (xi, 306 pages) :  |b illustrations. 
336 |a text  |b txt  |2 rdacontent. 
337 |a computer  |b c  |2 rdamedia. 
338 |a online resource  |b cr  |2 rdacarrier. 
490 1 |a Annals of discrete mathematics ;  |v 36. 
504 |a Includes bibliographical references (pages 233-290) 
500 |a Includes indexes. 
505 0 |a Front Cover; Recent Results in the Theory of Graph Spectra; Copyright Page; Introduction; Contents; Chapter 1. Characterizations of Graphs by their Spectra; Chapter 2. Distance-Regular and Similar Graphs; Chapter 3. Miscellaneous Results from the Theory of Graph Spectra; Chapter 4. The Matching Polynomial and Other Graph Polynomials; Chapter 5. Applications to Chemistry and Other Branches of Science; Chapter 6. Spectra of Infinite Graphs; Spectra of Graphs with Seven Vertices; Bibliography; Bibliographic Index; Index. 
520 |a The purpose of this volume is to review the results in spectral graph theory which have appeared since 1978. The problem of characterizing graphs with least eigenvalue -2 was one of the original problems of spectral graph theory. The techniques used in the investigation of this problem have continued to be useful in other contexts including forbidden subgraph techniques as well as geometric methods involving root systems. In the meantime, the particular problem giving rise to these methods has been solved almost completely. This is indicated in Chapter 1. The study of various combinatorial objects (including distance regular and distance transitive graphs, association schemes, and block designs) have made use of eigenvalue techniques, usually as a method to show the nonexistence of objects with certain parameters. The basic method is to construct a graph which contains the structure of the combinatorial object and then to use the properties of the eigenvalues of the graph. Methods of this type are given in Chapter 2. Several topics have been included in Chapter 3, including the relationships between the spectrum and automorphism group of a graph, the graph isomorphism and the graph reconstruction problem, spectra of random graphs, and the Shannon capacity problem. Some graph polynomials related to the characteristic polynomial are described in Chapter 4. These include the matching, distance, and permanental polynomials. Applications of the theory of graph spectra to Chemistry and other branches of science are described from a mathematical viewpoint in Chapter 5. The last chapter is devoted to the extension of the theory of graph spectra to infinite graphs. 
588 0 |a Print version record. 
650 0 |a Graph theory.  |0 http://id.loc.gov/authorities/subjects/sh85056471. 
650 0 |a Matrices.  |0 http://id.loc.gov/authorities/subjects/sh85082210. 
650 7 |a Graph theory.  |2 fast  |0 (OCoLC)fst00946584. 
650 7 |a Matrices.  |2 fast  |0 (OCoLC)fst01012399. 
700 1 |a Cvetković, Dragoš M.  |0 http://id.loc.gov/authorities/names/n82203562  |1 http://isni.org/isni/0000000117453426. 
776 0 8 |i Print version:  |t Recent results in the theory of graph spectra.  |d Amsterdam ; New York : North-Holland ; New York, N.Y., U.S.A. : Sole distributors for the U.S.A. and Canada, Elsevier Science, 1988  |z 0444703616  |z 9780444703613  |w (DLC) 87030577  |w (OCoLC)16985895. 
830 0 |a Annals of discrete mathematics ;  |v 36.  |0 http://id.loc.gov/authorities/names/n42002128. 
856 4 0 |u https://colorado.idm.oclc.org/login?url=https://www.sciencedirect.com/science/bookseries/01675060/36  |z Full Text (via ScienceDirect) 
907 |a .b103197187  |b 03-19-20  |c 02-05-19 
998 |a web  |b 02-28-19  |c b  |d b   |e -  |f eng  |g ne   |h 0  |i 1 
907 |a .b103197187  |b 07-02-19  |c 02-05-19 
944 |a MARS - RDA ENRICHED 
907 |a .b103197187  |b 03-12-19  |c 02-05-19 
915 |a I 
956 |a ScienceDirect ebooks 
956 |b ScienceDirect All Books 
999 f f |i c6347b4c-84b5-559a-a649-242da7a7b9ef  |s 78cd9a33-1333-52ea-a855-a2d84d68bc83 
952 f f |p Can circulate  |a University of Colorado Boulder  |b Online  |c Online  |d Online  |e QA166 .R43 1988eb  |h Library of Congress classification  |i web  |n 1