Spectral Generalizations of Line Graphs: On Graphs with Least Eigenvalue -2 (London Mathematical Society Lecture Note Series)

Cvetkovic, Dragos; Rowlinson, Peter; Simic, Slobodan

ISBN 10: 0521836638 / ISBN 13: 9780521836630

Published by Cambridge University Press, 2004

About this Item

LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS.

Seller Inventory # ERICA70405218366385

Bibliographic Details

• Title: Spectral Generalizations of Line Graphs: On Graphs with Least Eigenvalue -2 (London Mathematical Society Lecture Note Series)
• Publisher: Cambridge University Press
• Publication Date: 2004
• Language: English
• ISBN 10: 0521836638
• ISBN 13: 9780521836630
• Binding: Paperback
• Condition: Like New
• Book Type: book

About this title

Synopsis

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. Technical descriptions of these graphs are included in the appendices, while the bibliography provides over 250 references. It will be an important resource for all researchers with an interest in algebraic graph theory.

Book Description

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.