Sprache: Englisch
Verlag: Cambridge University Press, 2004
ISBN 10: 0521836638 ISBN 13: 9780521836630
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 92,24
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Verlag: Cambridge u a University Press, 2004
ISBN 10: 0521836638 ISBN 13: 9780521836630
1. Original-kartoniert; 8°; xi (i) 298 (2) Seiten. Sehr gutes Exemplar. Sprache: Englisch London Mathematical Society Lecture Note Series ; 314. 460 gr.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 113,95
Anzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 310 pages. 8.75x6.00x0.75 inches. In Stock.
Sprache: Englisch
Verlag: Cambridge University Press, 2004
ISBN 10: 0521836638 ISBN 13: 9780521836630
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 130,20
Anzahl: 1 verfügbar
In den WarenkorbZustand: New. pp. xi + 298 Illus.
Sprache: Englisch
Verlag: Cambridge University Press, 2004
ISBN 10: 0521836638 ISBN 13: 9780521836630
Anbieter: Kennys Bookstore, Olney, MD, USA
EUR 130,86
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. An important resource for all researchers with an interest in algebraic graph theory. Series Editor(s): Hitchin, N. J. (University of Cambridge). Series: London Mathematical Society Lecture Note Series. Num Pages: 310 pages, 47 b/w illus. 9 tables. BIC Classification: PBC; PBV. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 17. Weight in Grams: 416. . 2004. Illustrated. paperback. . . . . Books ship from the US and Ireland.
Sprache: Englisch
Verlag: Cambridge University Press, 2004
ISBN 10: 0521836638 ISBN 13: 9780521836630
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Line graphs have the property that their least eigenvalue is greater than or equal to -2, a property shared by generalized line graphs and a finite number of so-called exceptional graphs. This book deals with all these families of graphs in the context of their spectral properties. The authors discuss the three principal techniques that have been employed, namely 'forbidden subgraphs', 'root systems' and 'star complements'. They bring together the major results in the area, including the recent construction of all the maximal exceptional graphs. Technical descriptions of these graphs are included in the appendices, while the bibliography provides over 250 references. This will be an important resource for all researchers with an interest in algebraic graph theory.