Articles liés à Recent Results in the Theory of Graph Spectra
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Présentation de l'éditeur
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Résultats de recherche pour Recent Results in the Theory of Graph Spectra
Image d'archives
Recent Results in the Theory of Graph Spectra
Edité par
North-Holland, 1991
ISBN 10 : 0444703616
ISBN 13 : 9780444703613
Ancien ou d'occasion
Couverture rigide
Vendeur : Ammareal, Morangis, France
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : Très bon. Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Salissures sur la tranche. Edition 1991. Tome 36. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Slight signs of wear on the cover. Stains on the edge. Edition 1991. Volume 36. Ammareal gives back up to 15% of this item's net price to charity organizations. N° de réf. du vendeur E-812-969
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Recent Results in the Theory of Graph Spectra: Annals of Discrete Mathematics 36
Edité par
North-Holland / Elsevier, Amsterdam/New York/Oxford/Tokyo, 1988
ISBN 10 : 0444703616
ISBN 13 : 9780444703613
Ancien ou d'occasion
Couverture rigide
Edition originale
Vendeur : Bookworks [MWABA, IOBA], Beloit, WI, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Hard Cover. Etat : Very Good. No Jacket. First Edition. Advanced math monograph, reviewing work in spectral graph theory since 1978, when Cvetkovic et al. first published a review of extant work. Hardcover, as pictured; no jacket, as issued. Light wear, minor spine fade; ink name (professor R. A. Brualdi, cited for four papers in the bibliography) & year on free endsheet. Text clean; xi, blank, 306 pages; index, bibliography, many figures & equations. Size: Octavo. N° de réf. du vendeur v0587
Quantité disponible : 1 disponible(s)